Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 789

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Optimization of sparse matrix–vector multiplication on emerging multicore platforms

Open access
Williams, Samuel, Oliker, Leonid, Vuduc, Richard, Shalf, John, Yelick, Katherine, Demmel, James·2009·Parallel Computing

Abstract

We are witnessing a dramatic change in computer architecture due to the multicore paradigm shift, as every electronic device from cell phones to supercomputers confronts parallelism of unprecedented scale. To fully unleash the potential of these systems, the HPC community must develop multicore specific optimization methodologies for important scientific computations. In this work, we examine sparse matrix-vector multiply (SpMV) - one of the most heavily used kernels in scientific computing - across a broad spectrum of multicore designs. Our experimental platform includes the homogeneous AMD dual-core and Intel quad-core designs, the heterogeneous STI Cell, as well as the first scientific study of the highly multithreaded Sun Niagara2. We present several optimization strategies especially effective for the multicore environment, and demonstrate significant performance improvements compared to existing state-of-the-art serial and parallel SpMV implementations. Additionally, we present key insights into the architectural tradeoffs of leading multicore design strategies, in the context of demanding memory-bound numerical algorithms.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.parco.2008.12.006

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 1 references

Research works printed but not linked: 23

  1. S. Balay, W.D. Gropp, L.C. McInnes, B.F. Smith, Efficient management of parallelism in object oriented numerical software libraries, in: E. Arge, A.M. Bruaset, H.P. Langtangen (Eds.), Modern Software Tools in Scientific Computing, 1997, pp. 163–202. · DOI · Paper page
  2. Borkar, 1999, Design challenges of technology scaling, IEEE Micro, 19, 23, 10.1109/40.782564 · DOI · Paper page
  3. M. Gschwind, Chip multiprocessing and the cell broadband engine, in: CF’06: Proceedings of the third Conference on Computing Frontiers, New York, NY, USA, 2006, pp. 1–8. · DOI
  4. Gschwind, 2006, Synergistic processing in Cell’s multicore architecture, IEEE Micro, 26, 10, 10.1109/MM.2006.41 · DOI
  5. Im, 2004, Sparsity: optimization framework for sparse matrix kernels, International Journal of High Performance Computing Applications, 18, 135, 10.1177/1094342004041296 · DOI · Paper page
  6. Kourtis, 2008, Optimizing sparse matrix–vector multiplication using index and value compression, In Conf. Computing Frontiers, 87
  7. B.C. Lee, R. Vuduc, J. Demmel, K. Yelick, Performance models for evaluation and automatic tuning of symmetric sparse matrix–vector multiply, in: Proceedings of the International Conference on Parallel Processing, Montreal, Canada, August 2004. · DOI
  8. J. Mellor-Crummey, J. Garvin, Optimizing sparse matrix vector multiply using unroll-and-jam, in: Proceedings of the LACSI Symposium, Santa Fe, NM, USA, October 2002.
  9. Nishtala, 2007, When cache blocking sparse matrix vector multiply works and why, Applicable Algebra in Engineering, Communication, and Computing, 1
  10. A. Pinar, M. Heath, Improving performance of sparse matrix–vector multiplication, in: Proceedings of the Supercomputing, 1999. · DOI · Paper page
  11. Rose, 1973, A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations, Graph Theory and Computing, 183
  12. Strout, 2004, Sparse tiling for stationary iterative methods, International Journal of High Performance Computing Applications, 18, 95, 10.1177/1094342004041294 · DOI
  13. O. Temam, W. Jalby, Characterizing the behavior of sparse algorithms on caches, in: Proceedings of the Supercomputing, 1992.
  14. S. Toledo, Improving memory-system performance of sparse matrix–vector multiplication, in: Eighth SIAM Conference on Parallel Processing for Scientific Computing, March 1997. · DOI · Paper page
  15. Vastenhouw, 2005, A two-dimensional data distribution method for parallel sparse matrix–vector multiplication, SIAM Review, 47, 67, 10.1137/S0036144502409019 · DOI
  16. R. Vuduc, Automatic performance tuning of sparse matrix kernels, PhD Thesis, University of California, Berkeley, Berkeley, CA, USA, December 2003.
  17. R. Vuduc, A. Gyulassy, J.W. Demmel, K.A. Yelick, Memory hierarchy optimizations and bounds for sparse ATAx, in: Proceedings of the ICCS Workshop on Parallel Linear Algebra, volume LNCS, Melbourne, Australia, June 2003, Springer. · DOI
  18. R. Vuduc, S. Kamil, J. Hsu, R. Nishtala, J.W. Demmel, K.A. Yelick, Automatic performance tuning and analysis of sparse triangular solve, in: ICS 2002: Workshop on Performance Optimization via High-Level Languages and Libraries, New York, USA, June 2002.
  19. J.B. White, P. Sadayappan, On improving the performance of sparse matrix–vector multiplication, in: Proceedings of the International Conference on High-Performance Computing, 1997.
  20. J. Willcock, A. Lumsdaine, Accelerating sparse matrix computations via data compression, in: Proceedings International Conference on Supercomputing (ICS), Cairns, Australia, June 2006. · DOI
  21. J.W. Willenbring, A.A. Anda, M. Heroux, Improving sparse matrix–vector product kernel performance and availabillity, in: Proceedings of the Midwest Instruction and Computing Symposium, Mt. Pleasant, IA, 2006.
  22. S. Williams, L. Oliker, R. Vuduc, J. Shalf, K. Yelick, J. Demmel, Optimization of sparse matrix–vector multiplication on emerging multicore platforms, in: Proceedings of the Supercomputing, 2007. · DOI · Paper page
  23. Williams, 2007, Scientific computing kernels on the cell processor, International Journal of Parallel Programming, 35, 263, 10.1007/s10766-007-0034-5 · DOI

Cited by

See all 789

Metadata

Authors
Williams, S., Oliker, L., Vuduc, R., Shalf, J., Yelick, K., & Demmel, J.
Venue
Parallel Computing
Publisher
Elsevier BV
Published
2009-03
Volume
35
Issue
3
Pages
178-194
ISSN
0167-8191 (ISSN-L)
OpenAlex
W1527464046
Cited by
789
References
1
FWCI
94.34
Type
journal article
Language
en
Open access
green
Licence
www.elsevier.com/tdm/userlicense/1.0/ (tdm)

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Optimization of sparse matrix–vector multiplication on emerging multicore platforms. https://app.cochat.ai/papers/10.1016/j.parco.2008.12.006
The paper
Williams, S., Oliker, L., Vuduc, R., Shalf, J., Yelick, K., & Demmel, J. (2009). Optimization of sparse matrix–vector multiplication on emerging multicore platforms. Parallel Computing. https://doi.org/10.1016/j.parco.2008.12.006

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.