Article

Free access

Improving performance of sparse matrix-vector multiplication

Authors:

Ali Pinar,

Michael T. HeathAuthors Info & Claims

SC '99: Proceedings of the 1999 ACM/IEEE conference on Supercomputing

Pages 30 - es

https://doi.org/10.1145/331532.331562

Published: 01 January 1999 Publication History

PDF eReader

References

[1]

R. C. Agarwal, F. G. Gustavson, and M. Zubair, "A high performance algorithm using pre-processing for sparse matrix vector multiplication", Proceedings of Supercomputing '92, pp. 32-41.

Digital Library

Google Scholar

[2]

D. A. Burgess and M. B. Giles, "Renumbering unstructured grids to improve the performance of codes on hierarchical memory machines", Tech. Rep. 95/06, Numerical Analysis Group, Oxford University Computing laboratory, May 1995.

Google Scholar

[3]

R. Das, D. J. Mavriplis, J. Saltz, S. Gupta, and R. Ponnusamy, "The design and implementation of a parallel unstructured Euler solver using software primitives", AIAA Journal, No: 32, pp. 489-496, 1994.

Crossref

Google Scholar

[4]

J. Perttunen, "The traveling salesman problem: the significance of initial solutions in composite heuristics", Vaasan Korkeakoulun julkaisuja, 0358-9080; no. 139, 1989.

Google Scholar

[5]

G. Reinelt The traveling salesman: computational solutions for TSP applications, Lecture Notes in Computer Science, Vol: 840, Springer-Verlag, 1994.

Google Scholar

[6]

O. Temam and W. Jalby, "Characterizing the behavior of sparse algorithms on caches", Proceedings of Supercomputing'92, 1992.

Digital Library

Google Scholar

[7]

S. Toledo, "Improving Memory-System Performance of Sparse Matrix-Vector Multiplication", Proceedings of the 8th SIAM Conference on Parallel Processing for Scientific Computing, March 1997.

Google Scholar

Cited By

View all

Ahmad MSardar UBatyrshin IHasnain MSajid KSidorov G(2024)Elegante: A Machine Learning-Based Threads Configuration Tool for SpMV Computations on Shared Memory ArchitectureInformation10.3390/info1511068515:11(685)Online publication date: 1-Nov-2024
https://doi.org/10.3390/info15110685
Regnault EBramas B(2024)SPC5: An efficient SpMV framework vectorized using ARM SVE and x86 AVX-512Computer Science and Information Systems10.2298/CSIS230819005R21:1(203-221)Online publication date: 2024
https://doi.org/10.2298/CSIS230819005R
Bank Tavakoli ERiera MQuraishi MRen F(2024)FSpGEMM: A Framework for Accelerating Sparse General Matrix–Matrix Multiplication Using Gustavson’s Algorithm on FPGAsIEEE Transactions on Very Large Scale Integration (VLSI) Systems10.1109/TVLSI.2024.335549932:4(633-644)Online publication date: Apr-2024
https://doi.org/10.1109/TVLSI.2024.3355499
Show More Cited By

Index Terms

Improving performance of sparse matrix-vector multiplication
1. Mathematics of computing
  1. Mathematical analysis
    1. Mathematical optimization
    2. Numerical analysis
      1. Computations on matrices
  2. Probability and statistics
2. Theory of computation
  1. Design and analysis of algorithms
    1. Mathematical optimization

Recommendations

Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks
SPAA '09: Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures

This paper introduces a storage format for sparse matrices, called compressed sparse blocks (CSB), which allows both Ax and A,x to be computed efficiently in parallel, where A is an n×n sparse matrix with nnzen nonzeros and x is a dense n-vector. Our ...
Processor-efficient sparse matrix-vector multiplication

The matrix-vector multiplication operation is the kernel of most numerical algorithms.Typically, matrix-vector multiplication algorithms exploit the sparsity of a matrix, either to reduce the time taken or the memory used. In the case of parallel ...
High-performance sparse matrix-vector multiplication on GPUs for structured grid computations
GPGPU-5: Proceedings of the 5th Annual Workshop on General Purpose Processing with Graphics Processing Units

In this paper, we address efficient sparse matrix-vector multiplication for matrices arising from structured grid problems with high degrees of freedom at each grid node. Sparse matrix-vector multiplication is a critical step in the iterative solution ...

Comments

Information & Contributors

Information

Published In

SC '99: Proceedings of the 1999 ACM/IEEE conference on Supercomputing

January 1999

1015 pages

ISBN:1581130910

DOI:10.1145/331532

General Chair:
Cherri Pancake

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1999

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SC '99

Sponsor:

SIGARCH
IEEE-CS

SC '99: International Conference for High Performance Computing, Networking, Storage and Analysis

November 14 - 19, 1999

Oregon, Portland, USA

Acceptance Rates

Overall Acceptance Rate 1,516 of 6,373 submissions, 24%

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

137
Total Citations
View Citations
1,786
Total Downloads

Downloads (Last 12 months)277
Downloads (Last 6 weeks)33

Reflects downloads up to 14 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ahmad MSardar UBatyrshin IHasnain MSajid KSidorov G(2024)Elegante: A Machine Learning-Based Threads Configuration Tool for SpMV Computations on Shared Memory ArchitectureInformation10.3390/info1511068515:11(685)Online publication date: 1-Nov-2024
https://doi.org/10.3390/info15110685
Regnault EBramas B(2024)SPC5: An efficient SpMV framework vectorized using ARM SVE and x86 AVX-512Computer Science and Information Systems10.2298/CSIS230819005R21:1(203-221)Online publication date: 2024
https://doi.org/10.2298/CSIS230819005R
Bank Tavakoli ERiera MQuraishi MRen F(2024)FSpGEMM: A Framework for Accelerating Sparse General Matrix–Matrix Multiplication Using Gustavson’s Algorithm on FPGAsIEEE Transactions on Very Large Scale Integration (VLSI) Systems10.1109/TVLSI.2024.335549932:4(633-644)Online publication date: Apr-2024
https://doi.org/10.1109/TVLSI.2024.3355499
Warnecke TLichtenberg G(2024) Hybrid implicit multilinear simulation using difference algebraic equations reordering by sparsity patterns * 2024 10th International Conference on Control, Decision and Information Technologies (CoDIT)10.1109/CoDIT62066.2024.10708218(2578-2583)Online publication date: 1-Jul-2024
https://doi.org/10.1109/CoDIT62066.2024.10708218
Wolfgang SRuiter STunnell MTriche TCarrier EDeBruine Z(2024)Value-Compressed Sparse Column (VCSC): Sparse Matrix Storage for Single-cell Omics Data2024 IEEE International Conference on Big Data (BigData)10.1109/BigData62323.2024.10825091(4952-4958)Online publication date: 15-Dec-2024
https://doi.org/10.1109/BigData62323.2024.10825091
Cao HTang SZhu QYu BChen W(2023)Mat2Stencil: A Modular Matrix-Based DSL for Explicit and Implicit Matrix-Free PDE Solvers on Structured GridProceedings of the ACM on Programming Languages10.1145/36228227:OOPSLA2(686-715)Online publication date: 16-Oct-2023
https://dl.acm.org/doi/10.1145/3622822
Islam ADai DMohror KArnold DBadia R(2023)DGAP: Efficient Dynamic Graph Analysis on Persistent MemoryProceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis10.1145/3581784.3607106(1-13)Online publication date: 12-Nov-2023
https://dl.acm.org/doi/10.1145/3581784.3607106
Castro RIvanov AAndrade DBen-Nun TFraguela BHoefler TMohror KArnold DBadia R(2023)VENOM: A Vectorized N:M Format for Unleashing the Power of Sparse Tensor CoresProceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis10.1145/3581784.3607087(1-14)Online publication date: 12-Nov-2023
https://dl.acm.org/doi/10.1145/3581784.3607087
Trotter JEkmekçibaşı SLangguth JTorun TDüzakın EIlic AUnat DMohror KArnold DBadia R(2023)Bringing Order to Sparsity: A Sparse Matrix Reordering Study on Multicore CPUsProceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis10.1145/3581784.3607046(1-13)Online publication date: 12-Nov-2023
https://dl.acm.org/doi/10.1145/3581784.3607046
Eggermann GRios MAnsaloni GNassif SAtienza D(2023)A 16-bit Floating-Point Near-SRAM Architecture for Low-power Sparse Matrix-Vector Multiplication2023 IFIP/IEEE 31st International Conference on Very Large Scale Integration (VLSI-SoC)10.1109/VLSI-SoC57769.2023.10321838(1-6)Online publication date: 16-Oct-2023
https://doi.org/10.1109/VLSI-SoC57769.2023.10321838
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks

Processor-efficient sparse matrix-vector multiplication

High-performance sparse matrix-vector multiplication on GPUs for structured grid computations