Failure Detectors to Solve Asynchronous k-Set Agreement: a Glimpse of Recent Results

Michel Raynal 1
1 ASAP - As Scalable As Possible: foundations of large scale dynamic distributed systems
Inria Rennes – Bretagne Atlantique , IRISA-D1 - SYSTÈMES LARGE ÉCHELLE
Abstract : In the k-set agreement problem, each process proposes a value and has to decide a value in such a way that a decided value is a proposed value and at most k different values are decided. This problem can easily be solved in synchronous systems or in asynchronous systems prone to t process crashes when t < k. In contrast, it has been shown that k-set agreement cannot be solved in asynchronous systems when k < t. Hence, since several years, the failure detector-based approach has been investigated to circumvent this impossibility. This approach consists in enriching the underlying asynchronous system with an additional module per process that provides it with information on failures. Hence, without becoming synchronous, the enriched system is no longer fully asynchronous. This paper surveys this approach in both asynchronous shared memory systems and asynchronous message passing systems. It presents and discusses recent results and associated k-set agreement algorithms.
Type de document :
[Research Report] PI-1959, 2010
Liste complète des métadonnées

Littérature citée [39 références]  Voir  Masquer  Télécharger
Contributeur : Ist Rennes <>
Soumis le : lundi 15 novembre 2010 - 13:08:41
Dernière modification le : vendredi 16 novembre 2018 - 01:39:00
Document(s) archivé(s) le : mercredi 16 février 2011 - 02:53:31


Fichiers produits par l'(les) auteur(s)


  • HAL Id : inria-00536089, version 1


Michel Raynal. Failure Detectors to Solve Asynchronous k-Set Agreement: a Glimpse of Recent Results. [Research Report] PI-1959, 2010. 〈inria-00536089〉



Consultations de la notice


Téléchargements de fichiers