By Topic

A polyalgorithmic approach applied for fast matrix multiplication on clusters

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Nasri, W. ; Departement des Sci. de l'' lnformatique, LIP2, Tunisia ; Trystram, D.

Summary form only given. 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 here a polyalgorithmic 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 polyalgorithm 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.

Published in:

Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International

Date of Conference:

26-30 April 2004