An efficient and robust decentralized algorithm for detecting the global convergence in asynchronous iterative algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

An efficient and robust decentralized algorithm for detecting the global convergence in asynchronous iterative algorithms

Abstract

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.
No file

Dates and versions

inria-00336515 , version 1 (04-11-2008)

Identifiers

  • HAL Id : inria-00336515 , version 1

Cite

Jacques Bahi, Sylvain Contassot-Vivier, Raphaël Couturier. An efficient and robust decentralized algorithm for detecting the global convergence in asynchronous iterative algorithms. 8th International Meeting on High Performance Computing for Computational Science, VECPAR'08, Jun 2008, Toulouse, France. pp.251--264. ⟨inria-00336515⟩
93 View
0 Download

Share

Gmail Facebook X LinkedIn More