Selecting optimal SpMV realizations for GPUs via machine learning. (May 2021)

• Record Type: Journal Article
• Authors: Dufrechou, Ernesto; Ezzatti, Pablo; Quintana-Ortí, Enrique S
• Other Names: Benner Peter guest-editor.
• Is Part Of: International journal of high performance computing applications. Volume 35:Number 3(2021)
• Page Start: 254
• Page End: 267
• Publication Date: 2021-05
• Subjects: Sparse numerical linear algebra -- sparse matrix-vector product (SpMV) -- automatic method selection -- machine learning -- parallel architectures -- graphics processing units (GPUs); High performance computing -- Periodicals; Supercomputers -- Periodicals; 004.1105
• DOI: 10.1177/1094342021990738
• Languages: English
• ISSNs: 1094-3420

Abstract

More than 10 years of research related to the development of efficient GPU routines for the sparse matrix-vector product (SpMV) have led to several realizations, each with its own strengths and weaknesses. In this work, we review some of the most relevant efforts on the subject, evaluate a few prominent routines that are publicly available using more than 3000 matrices from different applications, and apply machine learning techniques to anticipate which SpMV realization will perform best for each sparse matrix on a given parallel platform. Our numerical experiments confirm the methods offer such varied behaviors depending on the matrix structure that the identification of general rules to select the optimal method for a given matrix becomes extremely difficult, though some useful strategies (heuristics) can be defined. Using a machine learning approach, we show that it is possible to obtain unexpensive classifiers that predict the best method for a given sparse matrix with over 80% accuracy, demonstrating that this approach can deliver important reductions in both execution time and energy consumption.