Graph expansion and communication costs of fast matrix multiplication: Regular submission

Grey Ballard*, James Demmel, Olga Holtz, Oded Schwartz

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

22 Scopus citations

Abstract

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. For sequential algorithms these bounds are attainable and so optimal.

Original languageAmerican English
Title of host publicationSPAA'11 - Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures
Pages1-11
Number of pages11
DOIs
StatePublished - 2011
Externally publishedYes
Event23rd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'11 - San Jose, CA, United States
Duration: 4 Jun 20116 Jun 2011

Publication series

NameAnnual ACM Symposium on Parallelism in Algorithms and Architectures

Conference

Conference23rd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'11
Country/TerritoryUnited States
CitySan Jose, CA
Period4/06/116/06/11

Keywords

  • communication avoiding algorithms
  • fast matrix multiplication
  • i/o-complexity

Fingerprint

Dive into the research topics of 'Graph expansion and communication costs of fast matrix multiplication: Regular submission'. Together they form a unique fingerprint.

Cite this