Use of hybrid recursive CSR/COO data structures in sparse matrix-vector multiplication
- 1 October 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21575525,p. 327-335
Abstract
Recently, we have introduced an approach to basic sparse matrix computations on multicore cache based machines using recursive partitioning. Here, the memory representation of a sparse matrix consists of a set of submatrices, which are used as leaves of a quad-tree structure. In this paper, we evaluate the performance impact, on the Sparse Matrix-Vector Multiplication (SpMV), of a modification to our Recursive CSR implementation, allowing the use of multiple data structures in leaf matrices (CSR/COO, with either 16/32 bit indices).Keywords
This publication has 7 references indexed in Scilit:
- Assembling recursively stored sparse matrices2010
- On BLAS Operations with Recursively Stored Sparse Matrices2010
- On the Usage of 16 Bit Indices in Recursively Stored Sparse Matrices2010
- Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks2009
- Improving the Performance of Multithreaded Sparse Matrix-Vector Multiplication Using Index and Value Compression2008
- Optimization of sparse matrix-vector multiplication on emerging multicore platforms2007
- Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods1994