Skip to Main content Skip to Navigation
Journal articles

A decentralized and fault tolerant convergence detection algorithm for asynchronous iterative algorithms

Abstract : This article presents an algorithm that performs a decentralized detection of the global convergence of parallel asynchronous iterative applications. This algorithm is fault tolerant. It runs a decentralized saving procedure which enables this algorithm, after a node's crash, to replace the dead node by a new one which will continue the computing task from the last check point. Combined with the advantages of the asynchronous iteration model, this method allows us to compute very large scale problems using highly volatile parallel architectures like Peer-to-Peer and distributed clusters architectures. We also present the implementation of this algorithm in the JaceP2P platform which is dedicated to designing and executing parallel asynchronous iterative applications in volatile environments. Numerous experiments show the robustness and the efficiency of our algorithm.
Document type :
Journal articles
Complete list of metadata

https://hal.inria.fr/hal-00690461
Contributor : Ist Rennes <>
Submitted on : Monday, April 23, 2012 - 3:42:42 PM
Last modification on : Thursday, November 26, 2020 - 11:46:07 AM

Links full text

Identifiers

Citation

Jean-Claude Charr, Raphaël Couturier, David Laiymani. A decentralized and fault tolerant convergence detection algorithm for asynchronous iterative algorithms. Journal of Supercomputing, Springer Verlag, 2010, 53 (2), pp.269-292. ⟨10.1007/s11227-009-0293-6⟩. ⟨hal-00690461⟩

Share

Metrics

Record views

179