SIMD Algorithms for Matrix Multiplication on the Hypercube

In this paper we present a SIMD algorithm for n n matrix multiplication on a hypercube of p processors, with time complexity of O( p =3 ), and 2 < 3. For 1 p n n the new algorithm is better than the algorithm of Dekel, Nassimi and Sahni. The algorithm is derived by using the matricial visualization of the hypercube, suggested by Nassimi and Sahni