The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement

Abstract : To cope with the impossibility of solving agreement problems in asynchronous systems made up of n processes and prone to t process crashes, system designers tailor their algorithms to run fast in “normal” circumstances. Two orthogonal notions of “normality” have been studied in the past through failure detectors that give processes information about process crashes, and through conditions that restrict the inputs to an agreement problem. This paper investigates how the two approaches can benefit from each other to solve the k-set agreement problem, where processes must agree on at most k of their input values (when k = 1 we have the famous consensus problem). It proposes novel failure detectors for solving k-set agreement, and a protocol that combines them with conditions, establishing a new bridge among asynchronous, synchronous and partially synchronous systems with respect to agreement problems. The paper proves also a lower bound when solving the k-set agreement problem with a condition.
Type de document :
[Research Report] PI 1897, 2008, pp.30
Liste complète des métadonnées

Littérature citée [52 références]  Voir  Masquer  Télécharger
Contributeur : Anne Jaigu <>
Soumis le : jeudi 10 juillet 2008 - 16:32:16
Dernière modification le : vendredi 16 novembre 2018 - 01:38:23
Document(s) archivé(s) le : vendredi 28 mai 2010 - 23:22:44


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


  • HAL Id : inria-00294706, version 1


Achour Mostefaoui, Sergio Rajsbaum, Michel Raynal, Corentin Travers. The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement. [Research Report] PI 1897, 2008, pp.30. 〈inria-00294706〉



Consultations de la notice


Téléchargements de fichiers