A unified sparse matrix data format for efficient general sparse matrix-vector multiply on modern processors with wide SIMD units
Not on the map. Why?
Abstract (arXiv)
Sparse matrix-vector multiplication (spMVM) is the most time-consuming kernel in many numerical algorithms and has been studied extensively on all modern processor and accelerator architectures. However, the optimal sparse matrix data storage format is highly hardware-specific, which could become an obstacle when using heterogeneous systems. Also, it is as yet unclear how the wide single instruction multiple data (SIMD) units in current multi- and many-core processors should be used most efficiently if there is no structure in the sparsity pattern of the matrix. We suggest SELL-C-sigma, a variant of Sliced ELLPACK, as a SIMD-friendly data format which combines long-standing ideas from General Purpose Graphics Processing Units (GPGPUs) and vector computer programming. We discuss the advantages of SELL-C-sigma compared to established formats like Compressed Row Storage (CRS) and ELLPACK and show its suitability on a variety of hardware platforms (Intel Sandy Bridge, Intel Xeon Phi and Nvidia Tesla K20) for a wide range of test matrices from different application areas. Using appropriate performance models we develop deep insight into the data transfer properties of the SELL-C-sigma spMVM kernel. SELL-C-sigma comes with two tuning parameters whose performance impact across the range of test matrices is studied and for which reasonable choices are proposed. This leads to a hardware-independent ("catch-all") sparse matrix format, which achieves very high efficiency for all test matrices across all hardware platforms.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 23 Jul 2013.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 2; 2024: 0; 2025: 1; 2026: 3.
6 papers.
- 2025MACKO: Sparse Matrix-Vector Multiplication for Low Sparsitycited by 6
- 2023Cached Operator Reordering: A Unified View for Fast GNN Trainingcited by 5
- 2023Optimizing Sparse Linear Algebra Through Automatic Format Selection and Machine Learningcited by 1
- 2026Sparser, Faster, Lighter Transformer Language Modelscited by 0
- 2026SparseDitto: An Agentic Sparse Compilation Framework through Architecture-Aware Synthesis on GPUscited by 0
- 2026Simpler Methods Work Better for L1 Penalized Logistic Models and Large Datasetscited by 0
- 2026Simpler Methods Work Better for L1 Penalized Logistic Models and Large Datasets21 Sep 2026
- 2026SparseDitto: An Agentic Sparse Compilation Framework through Architecture-Aware Synthesis on GPUs5 Aug 2026
- 2026Sparser, Faster, Lighter Transformer Language Models24 Mar 2026
- 2025MACKO: Sparse Matrix-Vector Multiplication for Low Sparsity17 Nov 2025
- 2023Cached Operator Reordering: A Unified View for Fast GNN Training23 Aug 2023
- 2023Optimizing Sparse Linear Algebra Through Automatic Format Selection and Machine Learning9 Mar 2023