Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication

Sparse matrix-matrix multiplication (or SpGEMM) is a key primitive for many high-performance graph algorithms as well as for some linear solvers, such as algebraic multigrid. The scaling of existing parallel implementations of SpGEMM is heavily bound by communication. Even though 3D (or 2.5D) algori...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	SIAM journal on scientific computing 2016-01, Vol.38 (6), p.C624-C651
Hauptverfasser:	Azad, Ariful, Ballard, Grey, Buluç, Aydin, Demmel, James, Grigori, Laura, Schwartz, Oded, Toledo, Sivan, Williams, Samuel
Format:	Artikel
Sprache:	eng
Schlagworte:	2.5D algorithms 2D decomposition 3D algorithms Computer Science graph algorithms MATHEMATICS AND COMPUTING multithreading numerical linear algebra parallel computing sparse matrix-matrix multiplication SpGEMM
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!