187 citations · 1k across the 59 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DC2015★ 109 cited
Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication
Ariful Azad, Grey Ballard, Aydin Buluc +5
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 s…
cs.DC2015★ 51 cited
Graphs, Matrices, and the GraphBLAS: Seven Good Reasons
Jeremy Kepner, David Bader, Aydın Buluc +3
The analysis of graphs has become increasingly important to a wide range of applications. Graph analysis presents a number of unique challenges in the areas of (1) software complex…