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...

Full description

Bibliographic Details

Published in:	arXiv.org
Main Authors:	Azad, Ariful, Ballard, Grey, Aydin Buluc, Demmel, James, Grigori, Laura, Schwartz, Oded, Toledo, Sivan, Williams, Samuel
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 16.11.2016
Subjects:	Algorithms Matrices (mathematics) Multiplication Solvers Sparsity
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!