A Survey of Accelerating Parallel Sparse Linear Algebra
ACM Computing Surveys · 31.01.2024 · 56 (1) · 1-38
DOI: 10.1145/3604606 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Computing Surveys, online erschienen am 28.08.2023. Verfasst von Guoqing Xiao und 5 weiteren Autor:innen. Die Arbeit wurde bisher 21-mal zitiert (Crossref) und nennt 130 Literaturangaben. Gefördert von: Key-Area R&D Program of Guangdong Province, Programs of the National Natural Science Foundation of China, Outstanding Youth Funding of CCF-HUAWEI.
Abstract (Originalsprache)
Sparse linear algebra includes the fundamental and important operations in various large-scale scientific computing and real-world applications. There exists performance bottleneck for sparse linear algebra since it mainly contains the memory-bound computations with low arithmetic intensity. How to improve its performance has increasingly become a focus of research efforts. Using parallel computing techniques to accelerate sparse linear algebra is currently the most popular method, while facing various challenges, e.g., large-scale data brings difficulties in storage, and the sparsity of data leads to irregular memory accesses and parallel load imbalance. Therefore, this article provides a comprehensive overview on acceleration of sparse linear algebra operations using parallel computing platforms, where we focus on four main classifications: sparse matrix-vector multiplication (SpMV), sparse matrix-sparse vector multiplication (SpMSpV), sparse general matrix-matrix multiplication (SpGEMM), and sparse tensor algebra. The takeaways from this article include the following: understanding the challenges of accelerating linear sparse algebra on various hardware platforms; understanding how structured data sparsity can improve storage efficiency; understanding how to optimize parallel load balance; understanding how to improve the efficiency of memory accesses; understanding how do the adaptive frameworks automatically select the optimal algorithms; and understanding recent design trends for acceleration of parallel sparse linear algebra.
Förderung
- Key-Area R&D Program of Guangdong Province
- Programs of the National Natural Science Foundation of China
- Outstanding Youth Funding of CCF-HUAWEI
- Programs of Hunan Province
- Program of the Natural Science Foundation of Guangdong Province
- Program of Fundamental Research of Shenzhen
- Open Research Project of Zhejiang Lab
Zitieren
APA
Xiao, G., Yin, C., Zhou, T., Li, X., Chen, Y., & Li, K. (2024). A Survey of Accelerating Parallel Sparse Linear Algebra. ACM Computing Surveys, 56(1), 1-38. https://doi.org/10.1145/3604606
Vancouver
Xiao G, Yin C, Zhou T, Li X, Chen Y, Li K. A Survey of Accelerating Parallel Sparse Linear Algebra. ACM Computing Surveys. 2024;56(1):1-38. doi:10.1145/3604606
BibTeX
@article{Xiao2024,
author = {Xiao, Guoqing and Yin, Chuanghui and Zhou, Tao and Li, Xueqi and Chen, Yuedan and Li, Kenli},
title = {A Survey of Accelerating Parallel Sparse Linear Algebra},
journal = {ACM Computing Surveys},
year = {2024},
volume = {56},
number = {1},
pages = {1--38},
doi = {10.1145/3604606}
}
EUVIMED