The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Implementing sparse matrix-vector multiplication on throughput-oriented processors
Abstract
Sparse matrix-vector multiplication (SpMV) is of singular importance in sparse linear algebra. In contrast to the uniform regularity of dense linear algebra, sparse operations encounter a broad spectrum of matrices ranging from the regular to the highly irregular. Harnessing the tremendous potential of throughput-oriented processors for sparse operations requires that we expose substantial fine-grained parallelism and impose sufficient regularity on execution paths and memory access patterns. We explore SpMV methods that are well-suited to throughput-oriented architectures like the GPU and which exploit several common sparsity classes. The techniques we propose are efficient, successfully utilizing large percentages of peak bandwidth. Furthermore, they deliver excellent total throughput, averaging 16 GFLOP/s and 10 GFLOP/s in double precision for structured grid and unstructured mesh matrices, respectively, on a GeForce GTX 285. This is roughly 2.8 times the throughput previously achieved on Cell BE and more than 10 times that of a quad-core Intel Clovertown system.
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
Iterative Methods for Sparse Linear Systems
Saad, Y. (2003) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718003 · Cited by 13,790
Anderson, E., Bai, Z., Bischof, C., Blackford, L. S., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., et al. (1999) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719604 · Cited by 4,435
Basic Linear Algebra Subprograms for Fortran Usage
Lawson, C. L., Hanson, R. J., Kincaid, D. R., & Krogh, F. T. (1979) · ACM Transactions on Mathematical Software · doi:10.1145/355841.355847 · Cited by 1,634
Nickolls, J., Buck, I., Garland, M., & Skadron, K. (2008) · Queue · doi:10.1145/1365490.1365500 · Cited by 1,610
Self-citation(2008) · doi:10.1145/1401132.1401152 · Cited by 1,575
Self-citationNVIDIA Tesla: A Unified Graphics and Computing Architecture
Lindholm, E., Nickolls, J., Oberman, S., & Montrym, J. (2008) · IEEE Micro · doi:10.1109/mm.2008.31 · Cited by 1,362
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 · cited 5×
“All of our experiments are run on a system comprised of an NVIDIA GTX 285 GPU paired with an Intel Core i7 965 CPU.”
BackgroundInfluentialOptimization 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
Knyazev, A. V. (2001) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827500366124 · Cited by 778
Benchmarking GPUs to tune dense linear algebra
Volkov, V. M., & Demmel, J. W. (2008) · doi:10.5555/1413370.1413402 · Cited by 701
Ecient Sparse Matrix-Vector Multiplication on CUDA
Bell, N., & Garland, M. (2008) · Cited by 574
Self-citationScan 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
Sparsity: Optimization Framework for Sparse Matrix Kernels
Im, E.-J., Yelick, K., & Vuduc, R. (2004) · The International Journal of High Performance Computing Applications · doi:10.1177/1094342004041296 · Cited by 339
Automatic performance tuning of sparse matrix kernels
Vuduc, R. W., & Demmel, J. W. (2003) · Cited by 288
Implementation of a Portable Nested Data-Parallel Language
Blelloch, G. E., Hardwick, J. C., Sipelstein, J., Zagha, M., & Chatterjee, S. (1994) · Journal of Parallel and Distributed Computing · doi:10.1006/jpdc.1994.1038 · Cited by 226
Sparse matrix computations on manycore GPU's
Garland, M. (2008) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/1391469.1391473 · Cited by 84
Self-citation
Cited by
EIE: efficient inference engine on compressed deep neural network
Han, S., Liu, X., Mao, H., Pu, J., Pedram, A., Horowitz, M. A., & Dally, W. J. (2016) · ACM SIGARCH Computer Architecture News · doi:10.1145/3007787.3001163 · Cited by 1,937
EIE: Efficient Inference Engine on Compressed Deep Neural Network
Han, S., Liu, X., Mao, H., Pu, J., Pedram, A., Horowitz, M. A., & Dally, W. J. (2016) · 2016 ACM/IEEE 43rd Annual International Symposium on Computer Architecture (ISCA) · doi:10.1109/isca.2016.30 · Cited by 1,077
Wu, C., Agarwal, S., Curless, B., & Seitz, S. M. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995552 · Cited by 807
Debunking 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
PyCUDA and PyOpenCL: A scripting-based approach to GPU run-time code generation
Klöckner, A., Pinto, N., Lee, Y., Catanzaro, B., Ivanov, P., & Fasih, A. (2012) · Parallel Computing · doi:10.1016/j.parco.2011.09.001 · Cited by 573
Metadata
- Authors
- Bell, N., & Garland, M.
- Venue
- Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
- Publisher
- ACM
- Published
- 2009-11-14
- Pages
- 1-11
- OpenAlex
- W2128853364
- Cited by
- 900
- References
- 16
- FWCI
- 38.06
- 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
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.