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)
Computing with Infinitely Many Processes
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Optimal Implementation of the Weakest Failure Detector for Solving Consensus
SRDS '00 Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems
On implementing omega with weak reliability and synchrony assumptions
Proceedings of the twenty-second annual symposium on Principles of distributed computing
The Information Structure of Indulgent Consensus
IEEE Transactions on Computers
A pleasant stroll through the land of infinitely many creatures
ACM SIGACT News
Communication-efficient leader election and consensus with limited link synchrony
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
From Static Distributed Systems to Dynamic Systems
SRDS '05 Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems
DSN '06 Proceedings of the International Conference on Dependable Systems and Networks
Time-Free and Timer-Based Assumptions Can Be Combined to Obtain Eventual Leadership
IEEE Transactions on Parallel and Distributed Systems
Securing vehicular ad hoc networks
Journal of Computer Security - Special Issue on Security of Ad-hoc and Sensor Networks
A general characterization of indulgence
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Optimal message-driven implementations of omega with mute processes
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Implementing the Omega failure detector in the crash-recovery failure model
Journal of Computer and System Sciences
A simple and communication-efficient Omega algorithm in the crash-recovery model
Information Processing Letters
Chasing the Weakest System Model for Implementing Ω and Consensus
IEEE Transactions on Dependable and Secure Computing
Robust stabilizing leader election
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Dynamic adaptability for smart environments
DAIS'08 Proceedings of the 8th IFIP WG 6.1 international conference on Distributed applications and interoperable systems
Eventual Leader Election in Infinite Arrival Message-Passing System Model with Bounded Concurrency
EDCC '10 Proceedings of the 2010 European Dependable Computing Conference
International Journal of Web and Grid Services
From an Asynchronous Intermittent Rotating Star to an Eventual Leader
IEEE Transactions on Parallel and Distributed Systems
Communication and Agreement Abstractions for Fault-tolerant Asynchronous Distributed Systems
Communication and Agreement Abstractions for Fault-tolerant Asynchronous Distributed Systems
Communication-efficient leader election in crash-recovery systems
Journal of Systems and Software
Ω meets paxos: leader election and stability without eventual timely links
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Hi-index | 0.00 |
The election of an eventual leader in an asynchronous system prone to process crashes is an important problem of fault-tolerant distributed computing. This problem is known as the implementation of the failure detector Ω. Nearly all papers that propose algorithms implementing such an eventual leader service consider a static system. In contrast this paper considers a dynamic system, i.e. a system in which processes can join and leave. The paper has three main contributions. It first proposes a specification of Ω suited to dynamic systems. Then, it presents and proves correct two algorithms implementing this specification. Finally, the paper discusses the notion of an eventual leader suited to dynamic systems. It introduces an additional property related to system stability. The design of an algorithm satisfying this last property remains an open challenging problem.