16703

Shuffle Reduction Based Sparse Matrix-Vector Multiplication on Kepler GPU

Yuan Tao, Huang Zhi-Bin
College of Mathematics, Jilin Normal University, Siping Jilin 136000, China
International Journal of Grid and Distributed Computing, Vol. 9, No. 10, pp.99-106, 2016

@article{tao2016shuffle,

   title={Shuffle Reduction Based Sparse Matrix-Vector Multiplication on Kepler GPU},

   author={Tao, Yuan and Zhi-Bin, Huang},

   year={2016}

}

Download Download (PDF)   View View   Source Source   

246

views

GPU is the suitable equipment for accelerating computing-intensive applications in order to get the higher throughput for High Performance Computing (HPC). Sparse Matrix-Vector Multiplication (SpMV) is the core algorithm of HPC, so the SpMV’s throughput on GPU may affect the throughput on HPC platform. In the paper, we focus on the latency of reduction routine in SpMV included in CUSP, such as accessing shared memory and bank conflicting while multiple threads simultaneously accessing the same bank. We provide shuffle method to reduce the partial results instead of reducing in the shared memory in order to improve the throughput of SpMV on Kepler GPU. Experiments show that shuffle method can improve the throughput up to 9% of the original routine of SpMV in CUSP on average.
VN:F [1.9.22_1171]
Rating: 1.0/5 (1 vote cast)
Shuffle Reduction Based Sparse Matrix-Vector Multiplication on Kepler GPU, 1.0 out of 5 based on 1 rating

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: