Evaluation of the asynchronous iterative algorithms in the context of distant heterogeneous clusters

The subject of this paper is to show the high efficiency of asynchronism for parallel iterative algorithms in the context of grid computing, that is to say, with machines scattered on a broad geographical scale. The question is: does asynchronism help to reduce the communication penalty and the over...

Full description

Saved in:
Bibliographic Details
Published inParallel computing Vol. 31; no. 5; pp. 439 - 461
Main Authors Bahi, Jacques M., Contassot-Vivier, Sylvain, Couturier, Raphaël
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.05.2005
Elsevier
Subjects
Asynchronism
Computer Science
Distributed, Parallel, and Cluster Computing
Grid computing
Iterative algorithms
Modeling and Simulation
Asynchronism
Grid computing
Iterative algorithms
Online AccessGet full text

Cover

More Information
Summary:The subject of this paper is to show the high efficiency of asynchronism for parallel iterative algorithms in the context of grid computing, that is to say, with machines scattered on a broad geographical scale. The question is: does asynchronism help to reduce the communication penalty and the overall computation time of such a given algorithm? The asynchronous programming model is evaluated on two test problems representing two important classes of scientific applications: a stationary linear problem and a non-stationary non-linear problem. They are implemented with a multi-threaded environment and tested on a set of distant heterogeneous machines. Several experiments have been performed allowing us to compare the performances of such asynchronous algorithms and also to analyze their behavior and extract the main possible optimizations for their use in a grid computing context.
ISSN:0167-8191
1872-7336
DOI:10.1016/j.parco.2005.02.009