A Novel CSR-Based Sparse Matrix-Vector Multiplication on GPUs

Guixia He, Jiaquan Gao
Zhijiang College, Zhejiang University of Technology, Hangzhou 310024, China
Mathematical Problems in Engineering, 2016


   title={A Novel CSR-Based Sparse Matrix-Vector Multiplication on GPUs},

   author={He, Guixia and Gao, Jiaquan},



Download Download (PDF)   View View   Source Source   



Sparse matrix-vector multiplication (SpMV) is an important operation in scientific computations. Compressed sparse row (CSR) is the most frequently used format to store sparse matrices. However, CSR-based SpMVs on graphic processing units (GPUs), e.g., CSR-scalar and CSR-vector, usually have poor performance due to irregular memory access patterns. This motivates us to propose a perfect CSR-based SpMV on the GPU that is called PCSR. PCSR involves two kernels, and accesses CSR arrays in a fully coalesced manner by introducing a middle array, which greatly alleviates the deficiencies of CSRscalar (rare coalescing) and CSR-vector (partial coalescing). Test results on a single C2050 GPU show that PCSR fully outperforms CSR-scalar, CSRvector, and CSRMV and HYBMV in the vendor-tuned CUSPARSE library, and is comparable with a most recently proposed CSR-based algorithm, CSR-Adaptive. Furthermore, we extend PCSR on a single GPU to multiple GPUs. Experimental results on four C2050 GPUs show that no matter whether the communication between GPUs is considered or not, PCSR on multiple GPUs achieves good performance and has high parallel efficiency.
Rating: 0.5. From 2 votes.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: