Accelerating Sparse Matrix-Matrix Multiplication with GPU Tensor Cores
Not on the map. Why?
Abstract (arXiv)
Sparse general matrix-matrix multiplication (spGEMM) is an essential component in many scientific and data analytics applications. However, the sparsity pattern of the input matrices and the interaction of their patterns make spGEMM challenging. Modern GPUs include Tensor Core Units (TCUs), which specialize in dense matrix multiplication. Our aim is to re-purpose TCUs for sparse matrices. The key idea of our spGEMM algorithm, tSparse, is to multiply sparse rectangular blocks using the mixed precision mode of TCUs. tSparse partitions the input matrices into tiles and operates only on tiles which contain one or more elements. It creates a task list of the tiles, and performs matrix multiplication of these tiles using TCUs. To the best of our knowledge, this is the first time that TCUs are used in the context of spGEMM. We show that spGEMM, with our tiling approach, benefits from TCUs. Our approach significantly improves the performance of spGEMM in comparison to cuSPARSE, CUSP, RMerge2, Nsparse, AC-SpGEMM and spECK.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 29 Sep 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 4; 2022: 2; 2023: 0; 2024: 2; 2025: 1.
9 papers.
- 2022ZeroFL: Efficient On-Device Training for Federated Learning with Local Sparsitycited by 45
- 2021Accelerating Framework of Transformer by Hardware Design and Model Compression Co-Optimizationcited by 27
- 2024FC-KAN: Function Combinations in Kolmogorov-Arnold Networkscited by 18
- 2021TC-GNN: Bridging Sparse GNN Computation and Dense Tensor Cores on GPUscited by 17
- 2021GPU Semiring Primitives for Sparse Neighborhood Methodscited by 3
- 2021BitTrain: Sparse Bitmap Compression for Memory-Efficient Training on the Edgecited by 3
- 2024FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Corescited by 2
- 2025BLaST: High Performance Inference and Pretraining using BLock Sparse Transformerscited by 2
- 2022Learning from distinctive candidates to optimize reduced-precision convolution program on tensor corescited by 1
- 2025BLaST: High Performance Inference and Pretraining using BLock Sparse Transformers3 Jul 2025
- 2024FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores15 Dec 2024
- 2024FC-KAN: Function Combinations in Kolmogorov-Arnold Networks3 Sep 2024
- 2022ZeroFL: Efficient On-Device Training for Federated Learning with Local Sparsity4 Aug 2022
- 2022Learning from distinctive candidates to optimize reduced-precision convolution program on tensor cores11 Feb 2022
- 2021TC-GNN: Bridging Sparse GNN Computation and Dense Tensor Cores on GPUs3 Dec 2021
- 2021BitTrain: Sparse Bitmap Compression for Memory-Efficient Training on the Edge29 Oct 2021
- 2021Accelerating Framework of Transformer by Hardware Design and Model Compression Co-Optimization19 Oct 2021
- 2021GPU Semiring Primitives for Sparse Neighborhood Methods13 Apr 2021