282 citations · 531 across the 15 of their papers we have counts for
Showing cs.DCShow all
3 papers · 1 filter
cs.DC2020
Network Partitioning and Avoidable Contention
Yishai Oltchik, Oded Schwartz
Network contention frequently dominates the run time of parallel algorithms and limits scaling performance. Most previous studies mitigate or eliminate contention by utilizing one…
cs.DC2016★ 6 cited
Hypergraph Partitioning for Sparse Matrix-Matrix Multiplication
Grey Ballard, Alex Druinsky, Nicholas Knight +1
We propose a fine-grained hypergraph model for sparse matrix-matrix multiplication (SpGEMM), a key computational kernel in scientific computing and data analysis whose performance…
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…