Name
Abstract | ||
|---|---|---|
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) algorithms have been proposed and theoretically analyzed in the flat MPI model on Erdos-Renyi matrices, those algorithms had not been implemented in practice and their complexities had not been analyzed for the general case. In this work, we present the first ever implementation of the 3D SpGEMM formulation that also exploits multiple (intra-node and inter-node) levels of parallelism, achieving significant speedups over the state-of-the-art publicly available codes at all levels of concurrencies. We extensively evaluate our implementation and identify bottlenecks that should be subject to further research. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1137/15M104253X | SIAM JOURNAL ON SCIENTIFIC COMPUTING |
Keywords | Field | DocType |
parallel computing,numerical linear algebra,sparse matrix-matrix multiplication,2.5D algorithms,3D algorithms,multi threading,SpGEMM,2D decomposition,graph algorithms | Multithreading,Computer science,Matrix (mathematics),Parallel computing,Multiplication,Matrix multiplication,Scaling,Sparse matrix,Multigrid method,Numerical linear algebra | Journal |
Volume | Issue | ISSN |
38 | 6 | 1064-8275 |
Citations | PageRank | References |
20 | 0.76 | 22 |
Authors | ||
8 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ariful Azad | 1 | 138 | 15.71 |
| Grey Ballard | 2 | 503 | 32.73 |
| Aydin Buluc | 3 | 1057 | 67.49 |
| James Demmel | 4 | 4817 | 551.47 |
| Laura Grigori | 5 | 368 | 34.76 |
| Oded Schwartz | 6 | 516 | 33.91 |
| Sivan Toledo | 7 | 1995 | 181.13 |
| Samuel Williams | 8 | 1282 | 98.56 |