DocumentCode :
644410
Title :
Analysis of Sparse Matrix-Vector Multiplication Using Iterative Method in CUDA
Author :
Hassani, Rashid ; Fazely, Amirreza ; Choudhury, Ruchika ; Luksch, Peter
Author_Institution :
Dept. of Comput. Sci., Univ. of Rostock, Rostock, Germany
fYear :
2013
fDate :
17-19 July 2013
Firstpage :
262
Lastpage :
266
Abstract :
Scaling up the sparse matrix-vector multiplication has been at the heart of numerous studies in both academia and industry. The massive parallelism of graphics processing units offers tremendous performance in many high-performance computing applications. In this work, we discuss performance analysis for parallel implementation of sparse matrix-vector multiplication using the conjugate gradient algorithm that are efficiently implemented on the NVIDIA CUDA architecture to exploit the massive compute power of today´s GPUs. The results show that in comparison to the parallel CPU implementations, the parallel version of the conjugate gradient algorithm on GPU is in average 30 times faster depending on computational kernels.
Keywords :
conjugate gradient methods; graphics processing units; iterative methods; mathematics computing; matrix multiplication; parallel architectures; vectors; NVIDIA CUDA architecture; computational kernels; compute unified device architecture; conjugate gradient algorithm; graphics processing units; high-performance computing applications; iterative method; parallel CPU implementations; sparse matrix-vector multiplication; Computer architecture; Graphics processing units; Instruction sets; Iterative methods; Kernel; Registers; Sparse matrices; CUDA; Conjugate Gradient; GPU; SpMV;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Networking, Architecture and Storage (NAS), 2013 IEEE Eighth International Conference on
Conference_Location :
Xi´an
Type :
conf
DOI :
10.1109/NAS.2013.41
Filename :
6665374
Link To Document :
بازگشت