3 papers
cs.DC2018
A 3D Parallel Algorithm for QR Decomposition
Grey Ballard, James Demmel, Laura Grigori +2
Interprocessor communication often dominates the runtime of large matrix computations. We present a parallel algorithm for computing QR decompositions whose bandwidth cost (communi…
cs.DC2017
Communication Lower Bounds for Matricized Tensor Times Khatri-Rao Product
Grey Ballard, Nicholas Knight, Kathryn Rouse
The matricized-tensor times Khatri-Rao product computation is the typical bottleneck in algorithms for computing a CP decomposition of a tensor. In order to develop high performanc…
cs.DC2016
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…