Matrix multiplication on the MasPar using distance insensitive communication schemes

Abstract

Two parallel matrix multiplication algorithms are presented in this paper. These algorithms execute on a grid with toroidal connections. Their novelty is the utilization of communication schemes which theoretically are distance insensitive; the impact on the communication and computational complexities and costs compared with a theoretical analysis, is analyzed and evaluated. The proposed algorithms have been implemented on a MasPar array. An experimental evaluation of these algorithms is performed. A comparison is made for matrix multiplication between the MasPar and the SUN-4/390.<>