Communication lower bounds for distributed-memory matrix multiplication

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Most cited references 21

Record: found
Abstract: not found
Article: not found

Gaussian elimination is not optimal

Volker Strassen (1969)

0 comments Cited 276 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Article: not found

An inequality related to the isoperimetric inequality

L. H. Loomis, H Whitney (1949)

0 comments Cited 50 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Article: not found

SUMMA: scalable universal matrix multiplication algorithm

R. Van De Geijn, J. Watts (1997)

0 comments Cited 39 times – based on 0 reviews      Review now

Bookmark

All references

Author and article information

Journal

Title: Journal of Parallel and Distributed Computing

Abbreviated Title: Journal of Parallel and Distributed Computing

Publisher: Elsevier BV

ISSN (Print): 07437315

Publication date Created: September 2004

Publication date (Print): September 2004

Volume: 64

Issue: 9

Pages: 1017-1026

Article

DOI: 10.1016/j.jpdc.2004.03.021

SO-VID: b7ddf80d-62e7-41f0-b641-7883f537ad1e

License:

http://www.elsevier.com/tdm/userlicense/1.0/

History

Data availability:

Comments

Comment on this article

scite_

Smart Citations

Citing PublicationsSupportingMentioningContrasting

View Citations

See how this article has been cited at scite.ai

scite shows how a scientific paper has been cited by providing the context of the citation, a classification describing whether it supports, mentions, or contrasts the cited claim, and a label indicating in which section the citation was made.