Communication efficient matrix multiplication on hypercubes

DOI10.1016/0167-8191(89)90091-4zbMath0689.65024OpenAlexW2036678384MaRDI QIDQ582005

Jarle Berntsen

Publication date: 1989

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(89)90091-4

zbMATH Keywords

hypercubesblock algorithmsmatrix multiplicationasymptotic communication costcommunication overheadnearest neighbour communication

Mathematics Subject Classification ID

Parallel numerical computation (65Y05)

Related Items

A RECURRENCE-FREE VARIANT OF STRASSEN'S ALGORITHM ON HYPERCUBE∗ ⋮ Pebbling Game and Alternative Basis for High Performance Matrix Multiplication ⋮ Communication lower bounds and optimal algorithms for numerical linear algebra