Communication efficient matrix multiplication on hypercubes
From MaRDI portal
Publication:582005
DOI10.1016/0167-8191(89)90091-4zbMath0689.65024OpenAlexW2036678384MaRDI QIDQ582005
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
hypercubesblock algorithmsmatrix multiplicationasymptotic communication costcommunication overheadnearest neighbour communication
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