Matrix multiplication with a hypercube algorithm on multi-core processor cluster

Abstract

The algorithm of multiplication of matrices of Dekel, Nassimi and Sahani or Hypercube is analysed, modified and implemented on multicore processor cluster, where the number of processors used is less than that required by the algorithm n3₃. 2₃, 4₃ and 8₃ processing units are used to multiply matrices of the order of 10x10, 10₂x10₂ and 10₃X10₃. The results of the mathematical model of the modified algorithm and those obtained from the computational experiments show that it is possible to reach acceptable speedup and parallel efficiencies, based on the number of used processor units. It also shows that the influence of the external communication link among the nodes is reduced if a combination of the available communication channels among the cores in a multi-core cluster is used.