Cerberus: Triple Mode Acceleration of Sparse Matrix and Vector Multiplication
ACM Transactions on Architecture and Code Optimization · 30.06.2024 · 21 (2) · 1-24
DOI: 10.1145/3653020 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Transactions on Architecture and Code Optimization, online erschienen am 21.05.2024. Verfasst von Soojin Hwang und 3 weiteren Autor:innen. Die Arbeit wurde bisher 7-mal zitiert (Crossref) und nennt 67 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0). Gefördert von: Institute of Information & communications Technology Planning & Evaluation.
Abstract (Originalsprache)
The multiplication of sparse matrix and vector (SpMV) is one of the most widely used kernels in high-performance computing as well as machine learning acceleration for sparse neural networks. The design space of SpMV accelerators has two axes: algorithm and matrix representation. There have been two widely used algorithms and data representations. Two algorithms, scalar multiplication and dot product, can be combined with two sparse data representations, compressed sparse and bitmap formats for the matrix and vector. Although the prior accelerators adopted one of the possible designs, it is yet to be investigated which design is the best one across different hardware resources and workload characteristics. This paper first investigates the impact of design choices with respect to the algorithm and data representation. Our evaluation shows that no single design always outperforms the others across different workloads, but the two best designs (i.e., compressed sparse format and bitmap format with dot product) have complementary performance with trade-offs incurred by the matrix characteristics. Based on the analysis, this study proposes Cerberus, a triple-mode accelerator supporting two sparse operation modes in addition to the base dense mode. To allow such multi-mode operation, it proposes a prediction model based on matrix characteristics under a given hardware configuration, which statically selects the best mode for a given sparse matrix with its dimension and density information. Our experimental results show that Cerberus provides 12.1× performance improvements from a dense-only accelerator, and 1.5× improvements from a fixed best SpMV design.
Förderung
- Institute of Information & communications Technology Planning & Evaluation
Zitieren
APA
Hwang, S., Baek, D., Park, J., & Huh, J. (2024). Cerberus: Triple Mode Acceleration of Sparse Matrix and Vector Multiplication. ACM Transactions on Architecture and Code Optimization, 21(2), 1-24. https://doi.org/10.1145/3653020
Vancouver
Hwang S, Baek D, Park J, Huh J. Cerberus: Triple Mode Acceleration of Sparse Matrix and Vector Multiplication. ACM Transactions on Architecture and Code Optimization. 2024;21(2):1-24. doi:10.1145/3653020
BibTeX
@article{Hwang2024,
author = {Hwang, Soojin and Baek, Daehyeon and Park, Jongse and Huh, Jaehyuk},
title = {Cerberus: Triple Mode Acceleration of Sparse Matrix and Vector Multiplication},
journal = {ACM Transactions on Architecture and Code Optimization},
year = {2024},
volume = {21},
number = {2},
pages = {1--24},
doi = {10.1145/3653020}
}
EUVIMED