A three-dimensional approach to parallel matrix multiplication
- 1 September 1995
- journal article
- Published by IBM in IBM Journal of Research and Development
- Vol. 39 (5) , 575-582
- https://doi.org/10.1147/rd.395.0575
Abstract
A three-dimensional (3D) matrix multiplication algorithm for massivelyparallel processing systems is presented. The P processors areconfigured as a "virtual" processing cube with dimensions p 1 , p 2 , andp 3 proportional to the matrices" dimensions---M , N , and K. Eachprocessor performs a single local matrix multiplication of size M=p 1 \ThetaN=p 2 \Theta K=p 3 . Before the local computation can be carried out, eachsubcube must receive a single submatrix of A and B. After the single...Keywords
This publication has 0 references indexed in Scilit: