Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Sharing memory robustly in message-passing systems
Journal of the ACM (JACM)
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)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
Distributed Algorithms
Using Failure Detectors to Solve Consensus in Asynchronous Sharde-Memory Systems (Extended Abstract)
WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
On implementing omega with weak reliability and synchrony assumptions
Proceedings of the twenty-second annual symposium on Principles of distributed computing
A pleasant stroll through the land of infinitely many creatures
ACM SIGACT News
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
Distributed Computing
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
Atomic shared register access by asynchronous hardware
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
(Almost) all objects are universal in message passing systems
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Looking for a definition of dynamic distributed systems
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
Hi-index | 0.00 |
We study in this paper three classical problems of fault tolerance in a system where the set of processes is unknown. These three problems are: the consensus, the implementation of atomics registers and the eventual leader election. For this, we consider different models. In the first one, the communication and the processes are asynchronous. In this model, these three problems could not be solved, but we define the weakest failure detectors needed to solve them. We consider then a model where the processes and the communication are synchronous, which permit to realize synchronous rounds. In this case, the processes are created dynamically and may have crash failures. We prove that, if for all rounds at least one process is alive in two consecutive rounds, the consensus and the implementation of registers could be solved. The eventual leader election, which is in this case less interesting, can be solved also. Between these two extremities, we focus on the case where the communications are asynchronous. Concerning processes, we assume that, onetime a process is created, it remains alive forever. In this case, if the leader election is easy, the consensus and the implementation of registers are impossible. If we augment the system with the failure detector (Σ) which permits to realize a quorum, consensus and implementation of atomic register can be solved. At the end, we consider a partially synchronous model and we prove that the consensus and the implementation of atomic register could be solved if there exists a process that can communicate synchronously with the other processes.