17 citations · 67 across the 6 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2016★ 8 cited
Parallelepipeds obtaining HBL lower bounds
James Demmel, Alex Rusciano
This work studies the application of the discrete Holder-Brascamp-Lieb (HBL) inequalities to the design of communication optimal algorithms. In particular, it describes optimal til…
cs.DS2012★ 16 cited
Strong Scaling of Matrix Multiplication Algorithms and Memory-Independent Communication Lower Bounds
Grey Ballard, James Demmel, Olga Holtz +2
A parallel algorithm has perfect strong scaling if its running time on P processors is linear in 1/P, including all communication costs. Distributed-memory parallel algorithms for…
cs.DS2012★ 9 cited
Communication-Optimal Parallel Algorithm for Strassen's Matrix Multiplication
Grey Ballard, James Demmel, Olga Holtz +2
Parallel matrix multiplication is one of the most studied fundamental problems in distributed and high performance computing. We obtain a new parallel algorithm that is based on St…