The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
CSR5: An Efficient Storage Format for Cross-Platform Sparse Matrix-Vector Multiplication
Abstract
Sparse matrix-vector multiplication (SpMV) is a fundamental building block for numerous applications. In this paper, we propose CSR5 (Compressed Sparse Row 5), a new storage format, which offers high-throughput SpMV on various platforms including CPUs, GPUs and Xeon Phi. First, the CSR5 format is insensitive to the sparsity structure of the input matrix. Thus the single format can support an SpMV algorithm that is efficient both for regular matrices and for irregular matrices. Furthermore, we show that the overhead of the format conversion from the CSR to the CSR5 can be as low as the cost of a few SpMV operations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
The university of Florida sparse matrix collection
Davis, T. A., & Hu, Y. (2011) · ACM Transactions on Mathematical Software · doi:10.1145/2049662.2049663 · Cited by 3,630
Implementing sparse matrix-vector multiplication on throughput-oriented processors
Bell, N., & Garland, M. (2009) · Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis · doi:10.1145/1654059.1654078 · Cited by 900
Optimization 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
Optimization of sparse matrix–vector multiplication on emerging multicore platforms
Williams, S., Oliker, L., Vuduc, R., Shalf, J., Yelick, K., & Demmel, J. (2009) · Parallel Computing · doi:10.1016/j.parco.2008.12.006 · Cited by 789
Scan Primitives for GPU Computing
Sengupta, S., Harris, M., Zhang, Y., & Owens, J. D. (2007) · eScholarship (California Digital Library) · doi:10.2312/eggh/eggh07/097-106 · Cited by 510
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
Buluç, A., Fineman, J. T., Frigo, M., Gilbert, J. R., & Leiserson, C. E. (2009) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/1583991.1584053 · Cited by 430
Model-driven autotuning of sparse matrix-vector multiply on GPUs
Choi, J. W., Singh, A., & Vuduc, R. W. (2010) · ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · doi:10.1145/1693453.1693471 · Cited by 394
Automatic performance tuning of sparse matrix kernels
Vuduc, R. W., & Demmel, J. W. (2003) · Cited by 288
Efficient sparse matrix-vector multiplication on x86-based many-core processors
Liu, X., Smelyanskiy, M., Chow, E., & Dubey, P. K. (2013) · International Conference on Supercomputing · doi:10.1145/2464996.2465013 · Cited by 263
Cited by
Qi, P., Song, Y., Peng, H., Huang, S., Zhuge, Q., & Sha, E. H.-M. (2021) · Proceedings of the 2021 Great Lakes Symposium on VLSI · doi:10.1145/3453688.3461739 · Cited by 37
Metadata
- Authors
- Liu, W., & Vinter, B.
- Venue
- Proceedings of the 29th ACM on International Conference on Supercomputing
- Publisher
- ACM
- Published
- 2015-06-08
- Pages
- 339-350
- OpenAlex
- W2009654791
- Cited by
- 315
- References
- 23
- FWCI
- 17.13
- Type
- conference paper
- Language
- en
- Open access
- closed
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: CSR5: An Efficient Storage Format for Cross-Platform Sparse Matrix-Vector Multiplication. https://app.cochat.ai/papers/10.1145/2751205.2751209
- The paper
- Liu, W., & Vinter, B. (2015). CSR5: An Efficient Storage Format for Cross-Platform Sparse Matrix-Vector Multiplication. Proceedings of the 29th ACM on International Conference on Supercomputing. https://doi.org/10.1145/2751205.2751209
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.