The “standard” naive algorithm for computing the product of two  matrices that is typically presented in an introduction to linear algebra runs in  time on a sequential computer. Strassen [11] developed a recursive algorithm that computes the product of two  matrices in  sequential time. We present an efficient implementation of Strassen’s algorithm on coarse grained multicomputers with “nice” architectures.

coarse grained parallel computer, gather, scatter, permutation exchange, matrix multiplication.