.png){kind=icon}
.png){kind=icon}
Return
Optimizing sparse-dense matrix-matrix multiplication for DCUs
.png){kind=icon}
PRE
AI
DOI：10.1007/s42514-025-00254-x.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
To address the issues of sparse matrix load imbalance and parallelism degradation with increasing matrix size in the mainstream Sparse-dense matrix-matrix multiplication (SpMM) parallelization strategy row-split, we propose a new framework for parallel SpMM computation on DCUs (GPU-like accelerators). This framework is based on the standard CSR format, requiring no additional format conversion, and thus offers strong generality. To address the issue of load imbalance, we introduce a coarse-grained two-level binning strategy that categorizes the rows of the sparse matrix into three groups based on the number of non-zero elements. Dedicated computation kernels are designed for each category to better accommodate different types of computational tasks, thereby significantly improving load balance. To address the decline in parallelism as the matrix size increases, we design multiple optimized kernels and dynamically select the optimal configuration at runtime to maximize parallelism. Experimental results show that our proposed SpMM framework significantly outperforms two current state-of-the-art row-split based SpMM algorithms (rocSparse and GE-SpMM), achieving speedups of 5.4\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\times $$\end{document} and 2.28\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\times $$\end{document}, respectively.
Keywords:
SpMM
Sparse matrix
Load balancing
DCU accelerator
Journal
C
IF:
1.9
Papers:
38
Citations:
253