Matrix Multiplication on Two Interconnected Processors

Files in This Item:
 File SizeFormat
DownloadBecker_Lastovetsky_2006.pdf844.16 kBAdobe PDF
Title: Matrix Multiplication on Two Interconnected Processors
Authors: Becker, Brett A.Lastovetsky, Alexey
Permanent link:
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 clustersData analysisMatrix multiplicationParallel 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
This item is made available under a Creative Commons License:
Appears in Collections:Computer Science Research Collection

Show full item record

Citations 50

Last Week
Last month
checked on Sep 11, 2020

Page view(s)

Last Week
Last month
checked on May 21, 2022


checked on May 21, 2022

Google ScholarTM



If you are a publisher or author and have copyright concerns for any item, please email and the item will be withdrawn immediately. The author or person responsible for depositing the article will be contacted within one business day.