Cache friendly sparse matrix-vector multiplication

Authors:
Sardar Anisul Haque;Shahadat Hossain;M. Moreno Maza
Affiliations:
University of Western Ontario, London, Ontario, Canada;University of Lethbridge, Lethbridge, Alberta, Canada;University of Western Ontario, London, Ontario, Canada
Venue:
ACM Communications in Computer Algebra
Year:
2011

Citing 3
Cited 0

Improving the memory-system performance of sparse-matrix vector multiplication

IBM Journal of Research and Development
Improving performance of sparse matrix-vector multiplication

SC '99 Proceedings of the 1999 ACM/IEEE conference on Supercomputing
Cache-Oblivious Algorithms

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sparse matrix-vector multiplication or SpMxV is an important kernel in scientific computing. For example, in the conjugate gradient method, where SpMxV is the main computational step. Though the total number of arithmetic operations in SpMxV is fixed, reducing the probability of cache misses per operation is still a challenging area of research. In this work, we present a new column ordering algorithm for sparse matrices. We analyze the cache complexity of SpMxV when A is ordered by our technique. The numerical experiments, with very large test matrices, clearly demonstrate the performance gains rendered by our proposed technique.