14. New Ideas in Sparse Matrix Matrix Multiplication
Aydın Buluç, John R. Gilbert · Society for Industrial and Applied Mathematics eBooks · 2011
Generalized sparse matrix matrix multiplication is a key primitive for many high performance graph algorithms as well as some linear solvers such as multigrid. We present the first parallel algorithms that achieve increasing speedups for an unbounded number of processors. Our algorithms are based on the two-dimensional (2D) block distribution of sparse matrices where serial sections use a novel hypersparse kernel for scalability.