Title: Automatic Selection of Sparse Matrix Representation on GPUs
Abstract: Sparse matrix-vector multiplication (SpMV) is a core kernel in numerous applications, ranging from physics simulation and large-scale solvers to data analytics. Many GPU implementations of SpMV have been proposed, targeting several sparse representations and aiming at maximizing overall performance. No single sparse matrix representation is uniformly superior, and the best performing representation varies for sparse matrices with different sparsity patterns.
Publication Year: 2015
Publication Date: 2015-06-02
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 111
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot