Efficient sparse-matrix multi-vector product on GPUs

  • Hong, C.; 
  • Sukumaran-Rajam, A.; 
  • Bandyopadhyay, B.; 
  • Kim, J.; 
  • Kurt, S.E.; 
  • 외 5명
Citations

SCOPUS

71

초록

Sparse Matrix-Vector (SpMV) and Sparse Matrix-Multivector (SpMM) products are key kernels for computational science and data science. While GPUs offer significantly higher peak performance and memory bandwidth than multicore CPUs, achieving high performance on sparse computations on GPUs is very challenging. A tremendous amount of recent research has focused on various GPU implementations of the SpMV kernel. But the multi-vector SpMM kernel has received much less attention. In this paper, we present an in-depth analysis to contrast SpMV and SpMM, and develop a new sparse-matrix representation and computation approach suited to achieving high data-movement efficiency and effective GPU parallelization of SpMM. Experimental evaluation using the entire SuiteSparse matrix suite demonstrates significant performance improvement over existing SpMM implementations from vendor libraries. © 2018 Association for Computing Machinery.

키워드

GPU; Sparse Matrix Multi-Vector Multiplication; Sparse Matrix-Matrix Multiplication; Sparse Matrix-Vector Multiplication
제목
Efficient sparse-matrix multi-vector product on GPUs
저자
Hong, C.; Sukumaran-Rajam, A.; Bandyopadhyay, B.; Kim, J.; Kurt, S.E.; Nisa, I.; Sabhlok, S.; Çatalyürek, Ü.V.; Parthasarathy, S.; Sadayappan, P.
DOI
10.1145/3208040.3208062
발행일
2018-06
유형
Conference Paper
저널명
HPDC 2018 - Proceedings of the 2018 International Symposium on High-Performance Parallel and Distributed Computing
페이지
66 ~ 79