Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
On BLAS Operations with Recursively Stored Sparse Matrices
SYNASC '10 Proceedings of the 2010 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
| Hi-index | 0.00 |
The Recursive Sparse Blocks (RSB) is a sparse matrix layout designed for coarse grained parallelism and reduced cache misses when operating with matrices, which are larger than a computer's cache. By laying out the matrix in sparse, non overlapping blocks, we allow for the shared memory parallel execution of transposed SParse Matrix-Vector multiply (SpMV), with higher efficiency than the traditional Compressed Sparse Rows (CSR) format. In this note we cover two issues. First, we propose two improvements to our original approach. Second, we look at the performance of standard and transposed shared memory parallel SpMV for unsymmetric matrices, using the proposed approach. We find that our implementation's performance is competitive with that of both the highly optimized, proprietary Intel MKL Sparse BLAS library's CSR routines, and the Compressed Sparse Blocks (CSB) research prototype.