Matrix Multiplication on Two Interconnected Processors

Author

Becker, Brett A. ; Lastovetsky, Alexey

Author_Institution

Sch. of Comput. Sci. & Informatics, Univ. Coll. Dublin

fYear

2006

fDate

25-28 Sept. 2006

Firstpage

1

Lastpage

9

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

Keywords

data analysis; matrix multiplication; parallel algorithms; workstation clusters; hierarchal algorithm; interconnected clusters; interconnected heterogeneous processors; interconnected processors; matrix multiplication; partitioning algorithm; partitionings; Algorithm design and analysis; Clustering algorithms; Computer architecture; Computer science; Concurrent computing; Educational institutions; Informatics; Kernel; Partitioning algorithms; User centered design;

fLanguage

English

Publisher

ieee

Conference_Titel

Cluster Computing, 2006 IEEE International Conference on

Conference_Location

Barcelona

ISSN

1552-5244

Print_ISBN

1-4244-0327-8

Electronic_ISBN

1552-5244

Type

conf

DOI

10.1109/CLUSTR.2006.311901

Filename

4100407