Parallel and Distributed Processing Symposium, International (2004)

Santa Fe, New Mexico

Apr. 26, 2004 to Apr. 30, 2004

ISBN: 0-7695-2132-0

pp: 234a

Wahid Nasri , LIP2

Denis Trystram , ID-IMAG Grenoble

ABSTRACT

There is today an increasing diversity of parallel execution supports. 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 resources. 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. More precisely, we propose a poly-algorithm which uses both advantages of standard and fast algorithms which is able to automatically choose the right and suitable algorithm for computing the matrix multiplication of any dimension on a particular parallel system. We target this approach on homogeneous clusters of PCs while providing some experiments.

INDEX TERMS

Cluster computing; Fast algorithms; Parallel matrix multiplication; Poly-algorithms; Strassen?s algorithm

CITATION

D. Trystram and W. Nasri, "A Poly-Algorithmic Approach Applied for Fast Matrix Multiplication on Clusters,"

*Parallel and Distributed Processing Symposium, International(IPDPS)*, Santa Fe, New Mexico, 2004, pp. 234a.

doi:10.1109/IPDPS.2004.1303281

CITATIONS