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

Grey Ballard; James Demmel; Olga Holtz; Oded Schwartz

doi:10.1145/1989493.1989495

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

Grey Ballard, James Demmel, Olga Holtz, Oded Schwartz

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 language	English
Title of host publication	SPAA'11 - Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures
Pages	1-11
Number of pages	11
DOIs	https://doi.org/10.1145/1989493.1989495
State	Published - 2011
Externally published	Yes
Event	23rd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'11 - San Jose, CA, United States Duration: 4 Jun 2011 → 6 Jun 2011

Publication series

Name	Annual ACM Symposium on Parallelism in Algorithms and Architectures

Conference

Conference	23rd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'11
Country/Territory	United States
City	San Jose, CA
Period	4/06/11 → 6/06/11

Keywords

communication avoiding algorithms
fast matrix multiplication
i/o-complexity

All Science Journal Classification (ASJC) codes

Software
Theoretical Computer Science
Hardware and Architecture

Access to Document

10.1145/1989493.1989495

Cite this

Ballard, G., Demmel, J., Holtz, O., & Schwartz, O. (2011). Graph expansion and communication costs of fast matrix multiplication: Regular submission. In SPAA'11 - Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures (pp. 1-11). (Annual ACM Symposium on Parallelism in Algorithms and Architectures). https://doi.org/10.1145/1989493.1989495

@inproceedings{31a325d33cdd4b04b8ee81b11947f031,

title = "Graph expansion and communication costs of fast matrix multiplication: Regular submission",

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.",

keywords = "communication avoiding algorithms, fast matrix multiplication, i/o-complexity",

author = "Grey Ballard and James Demmel and Olga Holtz and Oded Schwartz",

year = "2011",

doi = "10.1145/1989493.1989495",

language = "الإنجليزيّة",

isbn = "9781450307437",

series = "Annual ACM Symposium on Parallelism in Algorithms and Architectures",

pages = "1--11",

booktitle = "SPAA'11 - Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures",

note = "23rd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'11 ; Conference date: 04-06-2011 Through 06-06-2011",

}

Ballard, G, Demmel, J, Holtz, O & Schwartz, O 2011, Graph expansion and communication costs of fast matrix multiplication: Regular submission. in SPAA'11 - Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures. Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 1-11, 23rd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'11, San Jose, CA, United States, 4/06/11. https://doi.org/10.1145/1989493.1989495

Graph expansion and communication costs of fast matrix multiplication: Regular submission. / Ballard, Grey; Demmel, James; Holtz, Olga et al.
SPAA'11 - Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures. 2011. p. 1-11 (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Graph expansion and communication costs of fast matrix multiplication

T2 - 23rd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'11

AU - Ballard, Grey

AU - Demmel, James

AU - Holtz, Olga

AU - Schwartz, Oded

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - communication avoiding algorithms

KW - fast matrix multiplication

KW - i/o-complexity

UR - http://www.scopus.com/inward/record.url?scp=79959674766&partnerID=8YFLogxK

U2 - 10.1145/1989493.1989495

DO - 10.1145/1989493.1989495

M3 - منشور من مؤتمر

SN - 9781450307437

T3 - Annual ACM Symposium on Parallelism in Algorithms and Architectures

SP - 1

EP - 11

BT - SPAA'11 - Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures

Y2 - 4 June 2011 through 6 June 2011

ER -

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

Abstract

Publication series

Conference

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this