Graph Expansion and Communication Costs of Fast Matrix Multiplication

@article{Ballard2012GraphEA,
  title={Graph Expansion and Communication Costs of Fast Matrix Multiplication},
  author={Grey Ballard and James Demmel and Olga Holtz and Oded Schwartz},
  journal={J. ACM},
  year={2012},
  volume={59},
  pages={32:1-32:23}
}
The communication cost of algorithms (also known as I/O-complexity) is shown to be closely related to the expansion properties of the corresponding computation graphs. We demonstrate this on Strassen's and other fast matrix multiplication algorithms, and obtain the first lower bounds on their communication costs. In the sequential case, where the processor has a fast memory of size <i>M</i>, too small to store three <i>n</i>-by-<i>n</i> matrices, the lower bound on the number of words moved… CONTINUE READING
Highly Cited
This paper has 58 citations. REVIEW CITATIONS
38 Citations
0 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 38 extracted citations

58 Citations

051015'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 58 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…