An Efficient and Robust Decentralized Algorithm for Detecting the Global Convergence in Asynchronous Iterative Algorithms

In this paper we present a practical, efficient and robust algorithm for detecting the global convergence in any asynchronous iterative process. A proven theoretical version, together with a first practical version, was presented in [1]. However, the main drawback of that first practical version was...

Full description

Saved in:
Bibliographic Details
Published inHigh Performance Computing for Computational Science - VECPAR 2008 pp. 240 - 254
Main Authors Bahi, Jacques M., Contassot-Vivier, Sylvain, Couturier, Raphaël
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2008
SeriesLecture Notes in Computer Science
Subjects
Asynchronous iterative algorithms
convergence detection
Online AccessGet full text
ISBN3540928588
9783540928584
ISSN0302-9743
1611-3349
DOI10.1007/978-3-540-92859-1_22

Cover

More Information
Summary:In this paper we present a practical, efficient and robust algorithm for detecting the global convergence in any asynchronous iterative process. A proven theoretical version, together with a first practical version, was presented in [1]. However, the main drawback of that first practical version was to require the determination of the maximal communication time between any couple of nodes in the system during the entire iterative process. The version presented in this paper does not require any additional information on the parallel system while always ensuring correct detections.
ISBN:3540928588
9783540928584
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-540-92859-1_22