Communication efficient matrix multiplication on hypercubes (Q582005)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4129887
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Communication efficient matrix multiplication on hypercubes |
scientific article; zbMATH DE number 4129887 |
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
0.9982623
0 references
0.90600425
0 references
0.89739037
0 references
0.89592385
0 references
0.89326054
0 references
0.89040583
0 references
