SIMD algorithms for matrix multiplication on the hypercube
Carlos Alberto Alonso Sanches, S. W. Song · 2002
Presents a new algorithm for n/spl times/n matrix multiplication on a hypercube of p processors, which outperforms, in terms of time complexity, the best algorithms known in the literature, due to Dekel, Nassimi and Sahni (1981). These authors presented algorithms of O/spl lsqb/n/sup /spl lambda/p/sup (/spl lambdaspl minus/12)/spl rsqb/, with 2/spl lesspl lambda/>