282 citations · 531 across the 15 of their papers we have counts for
4 papers · 1 filter
Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication
Grey Ballard, James Demmel, Olga Holtz +2
Graph expansion analysis of computational DAGs is useful for obtaining communication cost lower bounds where previous methods, such as geometric embedding, are not applicable. This…
Delay-Doppler Channel Estimation with Almost Linear Complexity
Alexander Fish, Shamgar Gurevich, Ronny Hadani +2
A fundamental task in wireless communication is Channel Estimation: Compute the channel parameters a signal undergoes while traveling from a transmitter to a receiver. In the case…
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…
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…