An Efficient and Robust Decentralized Algorithm for Detecting the Global Convergence in Asynchronous Iterative Algorithms
Jacques M. Bahi (LIFC, University of Franche-Comté, Belfort, France)
Sylvain Contassot-Vivier (LORIA, University Henri Poincaré, Nancy, France)
Raphaël Couturier (LIFC, University of Franche-Comté, Belfort, France)
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.
Parallel and Distributed Computing, Grid Computing (middleware, algorithms, performance evaluation, ...)
Toulouse | France | 2008 | June | 24  25  26  27