spECK: Accelerating GPU sparse matrix-matrix multiplication through lightweight analysis

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Sparse general matrix-matrix multiplication on GPUs is challenging due to the varying sparsity patterns of sparse matrices. Existing solutions achieve good performance for certain types of matrices, but fail to accelerate all kinds of matrices in the same manner. Our approach combines multiple strategies with dynamic parameter selection to dynamically choose and tune the best fitting algorithm for each row of the matrix. This choice is supported by a lightweight, multi-level matrix analysis, which carefully balances analysis cost and expected performance gains. Our evaluation on thousands of matrices with various characteristics shows that we outperform all currently available solutions in 79% over all matrices with >15k products and that we achieve the second best performance in 15%. For these matrices, our solution is on average 83% faster than the second best approach and up to 25X faster than other state-of-the-art GPU implementations. Using our approach, applications can expect great performance independent of the matrices they work on.
Original languageEnglish
Title of host publicationProceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
PublisherAssociation of Computing Machinery
Pages362-375
Number of pages13
ISBN (Print)9781450368186
DOIs
Publication statusPublished - 19 Feb 2020
EventPPoPP ’20: 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming - San Diego, United States
Duration: 22 Feb 202026 Feb 2020

Conference

ConferencePPoPP ’20
CountryUnited States
CitySan Diego
Period22/02/2026/02/20

Fingerprint Dive into the research topics of 'spECK: Accelerating GPU sparse matrix-matrix multiplication through lightweight analysis'. Together they form a unique fingerprint.

Cite this