Contemporary accelerator designs exhibit a high degree of spatial localization, wherein two-
dimensional physical distance determines communication costs between processing …

Multiplying two sparse matrices (SpGEMM) is a common computational primitive used in
many areas including graph algorithms, bioinformatics, algebraic multigrid solvers, and …

We consider the distributed memory parallel multiplication of a sparse matrix by a dense
matrix (SpMM). The dense matrix is often a collection of dense vectors. Standard …

Matrix-matrix multiplication (MM) is one of the most fundamental computational kernels in
scientific computing. It is used in linear algebra algorithms [1, 2, 3, 4], graph processing [5 …