Libra: Unleashing GPU Heterogeneity for High-Performance Sparse Matrix Multiplication
Not on the map. Why?
Abstract (arXiv)
Sparse matrix multiplication operators (i.e., SpMM and SDDMM) are widely used in deep learning and scientific computing. Modern accelerators are commonly equipped with Tensor Core Units (TCUs) and CUDA cores to accelerate sparse operators. The former excels at structured matrix computations, whereas the latter offers greater programming flexibility. However, how to combine these two resources to maximize sparse-operator performance remains unclear. In this work, we first identify the source of performance gains in hybrid computation and systematically analyze their complementary strengths. Motivated by this, we propose Libra, a holistic framework that efficiently leverages heterogeneous computing resources to accelerate both SpMM and SDDMM operators. Specifically, Libra introduces a 2D-aware (locality and utilization) workload distribution method to precisely identify the optimal task mapping, simultaneously leveraging the data reuse capabilities of TCUs and the flexibility of CUDA cores to minimize computational redundancy. Libra further incorporates hybrid load balancing, occupancy-aware task scheduling, and efficient kernel implementations to maximize execution efficiency. Extensive experiments on H100 and RTX 4090 GPUs demonstrate that Libra surpasses all the 12 up-to-date baselines significantly, e.g., on average 1.77x speedup over FlashSparse, 1.73x over RoDe, and 2.9x over DGL for end-to-end GNN applications. Libra opens up a new perspective for sparse operator acceleration by fully unleashing the power of heterogeneous GPU resources.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 20 of its 57 references that are in the map. First posted on arXiv 28 Jun 2025.
Builds on
20 of 57 references.
References · 20
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2018How Powerful are Graph Neural Networks?cited by 4,393
- 2020Sparse GPU Kernels for Deep Learningcited by 141
- 2018Attention-based Graph Neural Network for Semi-supervised Learningcited by 101
- 2022SparseTIR: Composable Abstractions for Sparse Compilation in Deep Learningcited by 47
- 2020GE-SpMM: General-purpose Sparse Matrix-Matrix Multiplication on GPUs for Graph Neural Networkscited by 42
- 2017Learning Graph Representations with Embedding Propagationcited by 38
- 2023IGB: Addressing The Gaps In Labeling, Features, Heterogeneity, and Size of Public Graph Datasets for Deep Learning Researchcited by 30
- 2021QGTC: Accelerating Quantized Graph Neural Networks via GPU Tensor Corecited by 18
- 2021TC-GNN: Bridging Sparse GNN Computation and Dense Tensor Cores on GPUscited by 17
8 more
- 2022Efficient Quantized Sparse Matrix Operations on Tensor Corescited by 16
- 2014Tag-Aware Ordinal Sparse Factor Analysis for Learning and Content Analyticscited by 15
- 2024High Performance Unstructured SpMM Computation Using Tensor Corescited by 8
- 2023Cached Operator Reordering: A Unified View for Fast GNN Trainingcited by 5
- 2024UniSparse: An Intermediate Language for General Sparse Format Customizationcited by 4
- 2025Acc-SpMM: Accelerating General-purpose Sparse Matrix-Matrix Multiplication with GPU Tensor Corescited by 4
- 2024FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Corescited by 3
- 2024HC-SpMM: Accelerating Sparse Matrix-Matrix Multiplication for Graphs with Hybrid GPU Corescited by 1
Built on by
Citing papers per year: 2025: 1.
1 paper.