Becker, Brett A.Brett A.BeckerLastovetsky, AlexeyAlexeyLastovetsky2017-06-142017-06-142006 IEEE2006-10http://hdl.handle.net/10197/8604Proceedings of the 8th IEEE International Conference on Cluster Computing (Cluster 2006), October, 2006This paper presents a new partitioning algorithm to perform matrix multiplication on two interconnected heterogeneous processors. Data is partitioned in a way which minimizes the total volume of communication between the processors compared to more general partitionings, resulting in a lower total execution time whenever the power ratio between the processors is greater than 3:1. The algorithm has interesting and important applicability, particularly as the top-level partitioning in a hierarchal algorithm that is to perform matrix multiplication on two interconnected clusters of computers.enWorkstation clustersData analysisMatrix multiplicationParallel algorithmsConference Publication10.1109/CLUSTR.2006.3119012015-11-20https://creativecommons.org/licenses/by-nc-nd/3.0/ie/