Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement

Abstract : Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The impossibility of fault-tolerant set agreement in asynchronous networks is one of the seminal results in distributed computing. In synchronous networks, too, the complexity of set agreement has been a significant research challenge that has now been resolved. Real systems, however, are neither purely synchronous nor purely asynchronous. Rather, they tend to alternate between periods of synchrony and periods of asynchrony. Nothing specific is known about the complexity of set agreement in such a "partially synchronous" setting. In this paper, we address this challenge, presenting the first (asymptotically) tight bound on the complexity of set agreement in such systems. We introduce a novel technique for simulating, in a fault-prone asynchronous shared memory, executions of an asynchronous and failure-prone message-passing system in which some fragments appear synchronous to some processes. We use this simulation technique to derive a lower bound on the round complexity of set agreement in a partially synchronous system by a reduction from asynchronous wait-free set agreement. Specifically, we show that every set agreement protocol ret quires at least k + 2 synchronous rounds to decide. We present an (asymptotically) matching algorithm that relies on a distributed asynchrony detection mechanism to decide as soon as possible during periods of synchrony. From these two results, we derive the size of the minimal window of synchrony needed to solve set agreement.
Type de document :
Article dans une revue
Algorithmica, Springer Verlag, 2012, 62 (1-2), pp.595-629
Liste complète des métadonnées

Littérature citée [21 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00992774
Contributeur : Corentin Travers <>
Soumis le : lundi 19 mai 2014 - 15:43:37
Dernière modification le : jeudi 11 janvier 2018 - 06:20:17
Document(s) archivé(s) le : lundi 10 avril 2017 - 23:42:37

Fichier

kset-algorithmica.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00992774, version 1

Collections

Citation

Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers. Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement. Algorithmica, Springer Verlag, 2012, 62 (1-2), pp.595-629. 〈hal-00992774〉

Partager

Métriques

Consultations de la notice

297

Téléchargements de fichiers

71