Agreement without knowing everybody: a first step to dynamicity

Authors:
Mohssen Abboud;Carole Delporte-Gallet;Hugues Fauconnier
Affiliations:
LIAFA- CNRS et Université, Paris Cedex, France;LIAFA- CNRS et Université, Paris Cedex, France;LIAFA- CNRS et Université, Paris Cedex, France
Venue:
NOTERE '08 Proceedings of the 8th international conference on New technologies in distributed systems
Year:
2008

Citing 6
Cited 0

Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems

Journal of the ACM (JACM)
Distributed Algorithms

Distributed Algorithms
The weakest failure detectors to solve certain fundamental problems in distributed computing

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Eventual Leader Election with Weak Assumptions on Initial Knowledge, Communication Reliability, and Synchrony

DSN '06 Proceedings of the International Conference on Dependable Systems and Networks
Knowledge Connectivity vs. Synchrony Requirements for Fault-Tolerant Agreement in Unknown Networks

DSN '07 Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study in this paper the consensus problem in asynchronous models where the set of participating processes is not known. We prove that in this model the consensus is impossible to be solved even if no process may crash. We prove that the asynchronous model augmented with failure detector Σ, which enables to realize a quorum, is sufficient to circumvent this impossibility result. For this, we present an algorithm solving the consensus problem in this model.