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 accessAbstract
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.
Integrity signals
Registry
Cites
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.
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
OSKI: A library of automatically tuned sparse matrix kernels
Vuduc, R., Demmel, J. W., & Yelick, K. A. (2005) · Journal of Physics: Conference Series · doi:10.1088/1742-6596/16/1/071 · Cited by 490
Self-citation
Research works printed but not linked: 23
- 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
- Borkar, 1999, Design challenges of technology scaling, IEEE Micro, 19, 23, 10.1109/40.782564 · DOI · Paper page
- 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
- Gschwind, 2006, Synergistic processing in Cell’s multicore architecture, IEEE Micro, 26, 10, 10.1109/MM.2006.41 · DOI
- Im, 2004, Sparsity: optimization framework for sparse matrix kernels, International Journal of High Performance Computing Applications, 18, 135, 10.1177/1094342004041296 · DOI · Paper page
- Kourtis, 2008, Optimizing sparse matrix–vector multiplication using index and value compression, In Conf. Computing Frontiers, 87
- 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
- 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.
- Nishtala, 2007, When cache blocking sparse matrix vector multiply works and why, Applicable Algebra in Engineering, Communication, and Computing, 1
- A. Pinar, M. Heath, Improving performance of sparse matrix–vector multiplication, in: Proceedings of the Supercomputing, 1999. · DOI · Paper page
- Rose, 1973, A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations, Graph Theory and Computing, 183
- Strout, 2004, Sparse tiling for stationary iterative methods, International Journal of High Performance Computing Applications, 18, 95, 10.1177/1094342004041294 · DOI
- O. Temam, W. Jalby, Characterizing the behavior of sparse algorithms on caches, in: Proceedings of the Supercomputing, 1992.
- 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
- Vastenhouw, 2005, A two-dimensional data distribution method for parallel sparse matrix–vector multiplication, SIAM Review, 47, 67, 10.1137/S0036144502409019 · DOI
- R. Vuduc, Automatic performance tuning of sparse matrix kernels, PhD Thesis, University of California, Berkeley, Berkeley, CA, USA, December 2003.
- 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
- 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.
- 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.
- J. Willcock, A. Lumsdaine, Accelerating sparse matrix computations via data compression, in: Proceedings International Conference on Supercomputing (ICS), Cairns, Australia, June 2006. · DOI
- 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.
- 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
- 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
Williams, S., Waterman, A., & Patterson, D. A. (2009) · Communications of the ACM · doi:10.1145/1498765.1498785 · Cited by 2,798
Self-citationOptimization of sparse matrix-vector multiplication on emerging multicore platforms
Williams, S., Oliker, L., Vuduc, R., Shalf, J., Yelick, K., & Demmel, J. (2007) · Proceedings of the 2007 ACM/IEEE conference on Supercomputing · doi:10.1145/1362622.1362674 · Cited by 791
Self-citationDebunking the 100X GPU vs. CPU myth: an evaluation of throughput computing on CPU and GPU
Lee, V. W., Kim, C., Chhugani, J., Deisher, M., Kim, D., Nguyen, A. D., Satish, N., Smelyanskiy, M., Chennupaty, S., Hammarlund, P., et al. (2010) · Proceedings of the 37th annual international symposium on Computer architecture · doi:10.1145/1815961.1816021 · Cited by 640
A view of the parallel computing landscape
Asanovic, K., Bodik, R., Demmel, J., Keaveny, T., Keutzer, K., Kubiatowicz, J., Morgan, N., Patterson, D., Sen, K., Wawrzynek, J., et al. (2009) · Communications of the ACM · doi:10.1145/1562764.1562783 · Cited by 627
Self-citationStencil computation optimization and auto-tuning on state-of-the-art multicore architectures
Datta, K., Murphy, M., Volkov, V. M., Williams, S., Carter, J. T., Oliker, L., Patterson, D. A., Shalf, J. M., & Yelick, K. (2008) · IEEE International Conference on High Performance Computing, Data, and Analytics · doi:10.5555/1413370.1413375 · Cited by 462
Self-citation
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.