19875

A Systematic Survey of General Sparse Matrix-Matrix Multiplication

Jianhua Gao, Weixing Ji, Zhaonian Tan, Yueyan Zhao
School of Computer Science and Technology, Beijing Institute of Technology, Beijing, China
arXiv:2002.11273 [cs.DC], (26 Feb 2020)

@misc{gao2020systematic,

   title={A Systematic Survey of General Sparse Matrix-Matrix Multiplication},

   author={Jianhua Gao and Weixing Ji and Zhaonian Tan and Yueyan Zhao},

   year={2020},

   eprint={2002.11273},

   archivePrefix={arXiv},

   primaryClass={cs.DC}

}

Download Download (PDF)   View View   Source Source   

644

views

SpGEMM (General Sparse Matrix-Matrix Multiplication) has attracted much attention from researchers in fields of multigrid methods and graph analysis. Many optimization techniques have been developed for certain application fields and computing architecture over the decades. The objective of this paper is to provide a structured and comprehensive overview of the research on SpGEMM. Existing optimization techniques have been grouped into different categories based on their target problems and architectures. Covered topics include SpGEMM applications, size prediction of result matrix, matrix partitioning and load balancing, result accumulating, and target architecture-oriented optimization. The rationales of different algorithms in each category are analyzed, and a wide range of SpGEMM algorithms are summarized. This survey sufficiently reveals the latest progress and research status of SpGEMM optimization from 1977 to 2019. More specifically, an experimentally comparative study of existing implementations on CPU and GPU is presented. Based on our findings, we highlight future research directions and how future studies can leverage our findings to encourage better design and implementation.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2020 hgpu.org

All rights belong to the respective authors

Contact us: