Repeatedly performing sparse matrix-vector multiplication (SpMV) followed by transposed sparse matrix-vector multiplication (SpM(T)V) with the same matrix is a part of several algorithms, for example, the Lanczos bior...
详细信息
Repeatedly performing sparse matrix-vector multiplication (SpMV) followed by transposed sparse matrix-vector multiplication (SpM(T)V) with the same matrix is a part of several algorithms, for example, the Lanczos biorthogonalization algorithm and the biconjugate gradient method. Such algorithms can benefit from combining parallel SpMV and SpM(T)V into a single operation we call joint direct and transposed sparse matrix-vector multiplication (SpMM(T)V). In this article, we present a parallel SpMM(T)V algorithm for shared-memory CPUs. The algorithm uses a sparse matrix format that divides the stored matrix into sparse matrix blocks and compresses the row and column indices of the matrix. This sparse matrix format can be also used for SpMV, SpM(T)V, and similar sparse matrix-vector operations. We expand upon existing research by suggesting new variants of the parallel SpMM(T)V algorithm and by extending the algorithm to efficiently support symmetric matrices. We compare the performance of the presented parallel SpMM(T)V algorithm with alternative approaches, which use state-of-the-art sparse matrix formats and libraries, using sparse matrices from real-world applications. The performance results indicate that the median performance of our proposed parallel SpMM(T)V algorithm is up to 45% higher than of the alternative approaches.
暂无评论