Matrix Multiplication on Two Interconnected Processors
Files in This Item:
|Becker_Lastovetsky_2006.pdf||844.16 kB||Adobe PDF||Download|
|Title:||Matrix Multiplication on Two Interconnected Processors||Authors:||Becker, Brett A.
|Permanent link:||http://hdl.handle.net/10197/8604||Date:||Oct-2006||Online since:||2017-06-14T16:21:19Z||Abstract:||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 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.||Type of material:||Conference Publication||Copyright (published version):||2006 IEEE||Keywords:||Workstation clusters; Data analysis; Matrix multiplication; Parallel algorithms||DOI:||10.1109/CLUSTR.2006.311901||Language:||en||Status of Item:||Peer reviewed||Conference Details:||Proceedings of the 8th IEEE International Conference on Cluster Computing (Cluster 2006), October, 2006|
|Appears in Collections:||Computer Science Research Collection|
Show full item record
This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. For other possible restrictions on use please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.