Communication efficient matrix multiplication on hypercubes (Q582005): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q186566 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Volker Mehrmann / rank | |||
Normal rank | |||
Revision as of 14:11, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Communication efficient matrix multiplication on hypercubes |
scientific article |
Statements
Communication efficient matrix multiplication on hypercubes (English)
0 references
1989
0 references
A method is presented for matrix multiplication on hypercubes, that uses only nearest neighbour communication and reduces the asymptotic communication cost.
0 references
communication overhead
0 references
block algorithms
0 references
matrix multiplication
0 references
hypercubes
0 references
nearest neighbour communication
0 references
asymptotic communication cost
0 references
