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.
Type de document :
Communication dans un congrès
8th International Meeting on High Performance Computing for Computational Science, VECPAR'08, Jun 2008, Toulouse, France. pp.251--264, 2008
Liste complète des métadonnées

https://hal.inria.fr/inria-00336515
Contributeur : Sylvain Contassot-Vivier <>
Soumis le : mardi 4 novembre 2008 - 13:09:11
Dernière modification le : jeudi 15 février 2018 - 08:48:04

Identifiants

  • HAL Id : inria-00336515, version 1

Citation

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, 2008. 〈inria-00336515〉

Partager

Métriques

Consultations de la notice

310