Parallel algorithms and architectures for matrix multiplication
Theoretical investigation of matrix multiplication for square matrices on message passing systems, namely a linear array, a binary tree and a mesh of trees, taking into account communication time. Timing formulas are presented. The important question of processor efficiency is not discussed.
scientific article; zbMATH DE number 4121308