MERBIT: A GPU-Based SpMV Method for Iterative Workloads
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910200766660608 |
|---|---|
| author | Zhang, Qi Yao, Zhengan Jiang, Zhenglu Zhang, Zan-Bo |
| author_facet | Zhang, Qi Yao, Zhengan Jiang, Zhenglu Zhang, Zan-Bo |
| contents | Sparse Matrix-Vector Multiplication (SpMV) is the cornerstone in many iterative workloads, including large-scale graph analytics and sparse iterative solvers. Accelerating SpMV on real-world graphs remains challenging due to highly irregular sparsity patterns. In this paper, we propose MERBIT, a GPU SpMV method designed for repeated SpMV on irregular, graph-like sparse matrices, with PageRank as a representative motivating workload. MERBIT combines two key ideas from existing GPU SpMV methods. At the global level, it uses merge-path partitioning to balance work over nonzeros and row boundaries. At the local level, it encodes each merge-path segment using a compact bit-field descriptor. MERBIT improves workload balance and promotes coalesced memory access for both matrix loading and output writes; moreover, three optimization strategies are incorporated to further enhance performance. Experiments on 50 large irregular datasets demonstrate that MERBIT outperforms competitive baselines, including cuSPARSE, Ginkgo, and academic approaches, achieving average speedups of 1.27 and 1.25 over cuSPARSE COO in single and double precision, respectively. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_07391 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | MERBIT: A GPU-Based SpMV Method for Iterative Workloads Zhang, Qi Yao, Zhengan Jiang, Zhenglu Zhang, Zan-Bo Distributed, Parallel, and Cluster Computing Sparse Matrix-Vector Multiplication (SpMV) is the cornerstone in many iterative workloads, including large-scale graph analytics and sparse iterative solvers. Accelerating SpMV on real-world graphs remains challenging due to highly irregular sparsity patterns. In this paper, we propose MERBIT, a GPU SpMV method designed for repeated SpMV on irregular, graph-like sparse matrices, with PageRank as a representative motivating workload. MERBIT combines two key ideas from existing GPU SpMV methods. At the global level, it uses merge-path partitioning to balance work over nonzeros and row boundaries. At the local level, it encodes each merge-path segment using a compact bit-field descriptor. MERBIT improves workload balance and promotes coalesced memory access for both matrix loading and output writes; moreover, three optimization strategies are incorporated to further enhance performance. Experiments on 50 large irregular datasets demonstrate that MERBIT outperforms competitive baselines, including cuSPARSE, Ginkgo, and academic approaches, achieving average speedups of 1.27 and 1.25 over cuSPARSE COO in single and double precision, respectively. |
| title | MERBIT: A GPU-Based SpMV Method for Iterative Workloads |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2605.07391 |