Matrix Multiplication on Two Interconnected Processors

This 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

• Type: Conference
• Year: 2006
• Where: CLUSTER
• Authors: Brett A. Becker, Alexey L. Lastovetsky
• Keywords: CLUSTER 2006, Cluster Computing, Interconnected Heterogeneous Processors, Lower Total Execution, Matrix Multiplication