On improving the performance of sparse matrix-vector multiplication

James B. White, P. Sadayappan

Research output: Contribution to conferencePaperpeer-review

46 Scopus citations

Abstract

We analyze single-node performance of sparse matrix-vector multiplication by investigating issues of data locality and fine-grained parallelism. We examine the data-locality characteristics of the compressed-sparse-row representation and consider improvements in locality through matrix permutation. Motivated by potential improvements in fine-grained parallelism, we evaluate modified sparse-matrix representations. The results lead to general conclusions about improving single-node performance of sparse matrix-vector multiplication in parallel libraries of sparse iterative solvers.

Original languageEnglish
Pages66-71
Number of pages6
StatePublished - 1997
Externally publishedYes
EventProceedings of the 1997 4th International Conference on High Performance Computing, HiPC - Bangalore, India
Duration: Dec 18 1997Dec 21 1997

Conference

ConferenceProceedings of the 1997 4th International Conference on High Performance Computing, HiPC
CityBangalore, India
Period12/18/9712/21/97

Fingerprint

Dive into the research topics of 'On improving the performance of sparse matrix-vector multiplication'. Together they form a unique fingerprint.

Cite this