Vectorized Sparse Matrix Multiply for Compressed Row Storage Format

Abstract. The innovation of this work is a simple vectorizable algorithm for performing sparse matrix vector multiply in compressed sparse row (CSR) storage format. Unlike the vectorizable jagged diagonal format (JAD), this algorithm requires no data rearrangement and can be easily adapted to a sophisticated library framework such as PETSc. Numerical experiments on the Cray X1 show an order of magnitude improvement over the non-vectorized algorithm.

• Type: Conference
• Year: 2005
• Where: ICCS
• Authors: Eduardo F. D'Azevedo, Mark R. Fahey, Richard Tran Mills
• Keywords: ICCS 2005, Jagged Diagonal Format, Simple Vectorizable Algorithm, Sparse Matrix Vector