Scalable parallel matrix multiplication on distributed memory parallel computers
Keqin Li · 2002
Consider any known sequential algorithm for matrix multiplication over an arbitrary ring with time complexity O(Nα), where 2α/log N processors. Such a parallel computation is cost optimal and matches the performance of PRAM. Furthermore, our parallelization on a DMPC can be made fully scalable, that is, for all 1α/log N, multiplying two NxN matrices can be performed by a DMPC with p processors in O(Nα/p) rime, i.e., linear speedup and cost optimality can be achieved in the range [1..Nα/log N]. This unifies all known algorithms for matrix multiplication on DMPC, standard or non-standard, sequential or parallel. Extensions of our methods and results to other parallel systems are also presented. The above claims result in significant progress in scalable parallel matrix multiplication (as well as solving many other important problems) on distributed memory systems, both theoretically and practically.