Performance analysis of sparse matrix-vector multiplication (Spmv) on graphics processing units (gpus)
Loading...
Access rights
openAccess
Journal Title
Journal ISSN
Volume Title
A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal
View/Open full text file from the Research portal
Other link related to publication
View publication in the Research portal
View/Open full text file from the Research portal
Other link related to publication
Date
2020-10
Department
Major/Subject
Mcode
Degree programme
Language
en
Pages
30
1-30
1-30
Series
Electronics (Switzerland), Volume 9, issue 10
Abstract
Graphics processing units (GPUs) have delivered a remarkable performance for a variety of high performance computing (HPC) applications through massive parallelism. One such application is sparse matrix-vector (SpMV) computations, which is central to many scientific, engineering, and other applications including machine learning. No single SpMV storage or computation scheme provides consistent and sufficiently high performance for all matrices due to their varying sparsity patterns. An extensive literature review reveals that the performance of SpMV techniques on GPUs has not been studied in sufficient detail. In this paper, we provide a detailed performance analysis of SpMV performance on GPUs using four notable sparse matrix storage schemes (compressed sparse row (CSR), ELLAPCK (ELL), hybrid ELL/COO (HYB), and compressed sparse row 5 (CSR5)), five performance metrics (execution time, giga floating point operations per second (GFLOPS), achieved occupancy, instructions per warp, and warp execution efficiency), five matrix sparsity features (nnz, anpr, npr variance, maxnpr, and distavg), and 17 sparse matrices from 10 application domains (chemical simulations, computational fluid dynamics (CFD), electromagnetics, linear programming, economics, etc.). Subsequently, based on the deeper insights gained through the detailed performance analysis, we propose a technique called the heterogeneous CPU–GPU Hybrid (HCGHYB) scheme. It utilizes both the CPU and GPU in parallel and provides better performance over the HYB format by an average speedup of 1.7x. Heterogeneous computing is an important direction for SpMV and other application areas. Moreover, to the best of our knowledge, this is the first work where the SpMV performance on GPUs has been discussed in such depth. We believe that this work on SpMV performance analysis and the heterogeneous scheme will open up many new directions and improvements for the SpMV computing field in the future.Description
Keywords
CSR, CSR5, ELL, Graphics processing units (GPUs), Heterogeneous computing, High performance computing (HPC), HYB, Parallelization, Sparse matrix storage, Sparse matrix-vector multiplication (SpMV)
Other note
Citation
Alahmadi, S, Mohammed, T, Albeshri, A, Katib, I & Mehmood, R 2020, ' Performance analysis of sparse matrix-vector multiplication (Spmv) on graphics processing units (gpus) ', Electronics (Switzerland), vol. 9, no. 10, 1675, pp. 1-30 . https://doi.org/10.3390/electronics9101675
