A new approach for sparse matrix vector product on NVIDIA GPUs

F. Vazquez, J. J. Fernandez, E. M. Garzon
Department of Computer Architecture and Electronics, University of Almeria, Ctra. Sacramento s/n, Almeria 04120, Spain
Concurrency and Computation: Practice and Experience, 23: 815-826, 2011


   title={A new approach for sparse matrix vector product on NVIDIA GPUs},

   author={V{‘a}zquez, F. and Fern{‘a}ndez, JJ and Garz{‘o}n, EM},

   journal={Concurrency and Computation: Practice and Experience},


   publisher={Wiley Online Library}


Download Download (PDF)   View View   Source Source   



The sparse matrix vector product (SpMV) is a key operation in engineering and scientific computing and, hence, it has been subjected to intense research for a long time. The irregular computations involved in SpMV make its optimization challenging. Therefore, enormous effort has been devoted to devise data formats to store the sparse matrix with the ultimate aim of maximizing the performance. Graphics Processing Units (GPUs) have recently emerged as platforms that yield outstanding acceleration factors. SpMV implementations for NVIDIA GPUs have already appeared on the scene. This work proposes and evaluates a new implementation of SpMV for NVIDIA GPUs based on a new format, ELLPACK-R, that allows storage of the sparse matrix in a regular manner. A comparative evaluation against a variety of storage formats previously proposed has been carried out based on a representative set of test matrices. The results show that, although the performance strongly depends on the specific pattern of the matrix, the implementation based on ELLPACK-R achieves higher overall performance. Moreover, a comparison with standard state-of-the-art superscalar processors reveals that significant speedup factors are achieved with GPUs.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2021 hgpu.org

All rights belong to the respective authors

Contact us: