Title :
A Poly-Algorithm for Efficient Parallel Matrix Multiplication on Metacomputing Platforms
Author :
Jeddi, Sana ; Nasri, Wahid
Author_Institution :
Departement d´´Informatique, ESSTT, Tunis
Abstract :
There is today an increasing diversity of parallel execution supports. New characteristics are influencing the execution of parallel applications, like for instance the hierarchical structure and the heterogeneity of the processors. Designing efficient software that takes full advantages of such systems remains difficult Indeed, solving a target problem by using a single algorithm is not always efficient on any computational support. We present in this paper a poly-algorithmic approach for selecting the most suitable algorithm among various ones for given problem size and available metacomputing platform, like hierarchical clusters of SMPs (Symmetric Multi-Processors) which become more and more popular. Our principal objective here is to illustrate such an approach on the well-known matrix multiplication problem which is one of the most important basic numerical kernels
Keywords :
matrix multiplication; metacomputing; parallel algorithms; workstation clusters; Strassen´s algorithm; cluster computing; hierarchical clusters; metacomputing platforms; parallel execution supports; parallel matrix multiplication; polyalgorithm; scheduling; symmetric multiprocessors; Clustering algorithms; Computer architecture; Computer networks; Concurrent computing; Costs; Matrix decomposition; Metacomputing; Multiprocessor interconnection networks; Parallel algorithms; Symmetric matrices; Cluster computing; Hierarchical clusters; Metacomuting platforms; Parallel matrix multiplication; Poly-algorithmic approach; Scheduling; Strassen´s algorithm;
Conference_Titel :
Cluster Computing, 2005. IEEE International
Conference_Location :
Burlington, MA
Print_ISBN :
0-7803-9486-0
Electronic_ISBN :
1552-5244
DOI :
10.1109/CLUSTR.2005.347020