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)
Petal: distributed virtual disks
Proceedings of the seventh international conference on Architectural support for programming languages and operating systems
Frangipani: a scalable distributed file system
Proceedings of the sixteenth ACM symposium on Operating systems principles
Structured derivations of consensus algorithms for failure detectors
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
ACM Transactions on Computer Systems (TOCS)
Information Processing Letters
Revisiting the Paxos Algorithm
WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
Efficient Algorithms to Implement Unreliable Failure Detectors in Partially Synchronous Systems
Proceedings of the 13th International Symposium on Distributed Computing
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Unreliable Failure Detectors with Limited Scope Accuracy and an Application to Consensus
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
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
A necessary and sufficient condition for transforming limited accuracy failure detectors
Journal of Computer and System Sciences
Communication-efficient leader election and consensus with limited link synchrony
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Chain replication for supporting high throughput and availability
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Boxwood: abstractions as the foundation for storage infrastructure
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Timeliness, failure-detectors, and consensus performance
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
From an intermittent rotating star to a leader
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Optimal message-driven implementations of omega with mute processes
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
The Asynchronous Bounded-Cycle Model
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Proceedings of the 2009 ACM symposium on Applied Computing
Two Consensus Algorithms with Atomic Registers and Failure Detector Ω
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Partial synchrony based on set timeliness
Proceedings of the 28th ACM symposium on Principles of distributed computing
Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Optimal message-driven implementation of omega with mute processes
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Brief announcement: chasing the weakest system model for implementing Ω and consensus
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Byzantine consensus with few synchronous links
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
From an intermittent rotating star to a leader
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Robust stabilizing leader election
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
When consensus meets self-stabilization
Journal of Computer and System Sciences
Communication-efficient leader election in crash-recovery systems
Journal of Systems and Software
When consensus meets self-stabilization
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Leader election for replicated services using application scores
Middleware'11 Proceedings of the 12th ACM/IFIP/USENIX international conference on Middleware
Specifying and implementing an eventual leader service for dynamic systems
International Journal of Web and Grid Services
Leader election for replicated services using application scores
Proceedings of the 12th International Middleware Conference
Hi-index | 0.00 |
This paper provides a realization of distributed leader election without having any eventual timely links. Progress is guaranteed in the following weak setting: Eventually one process can send messages such that every message obtains f timely responses, where f is a resilience bound. A crucial facet of this property is that the f responders need not be fixed, and may change from one message to another. In particular, this means that no specific link needs to remain timely. In the (common) case where f=1, this implies that the FLP impossibility result on consensus is circumvented if one process can at any time communicate in a timely manner with one other process in the system. The protocol also bears significant practical importance to well-known coordination schemes such as Paxos, because our setting more precisely captures the conditions on the elected leader for reaching timely consensus. Additionally, an extension of our protocol provides leader stability, which guarantees against arbitrary demotion of a qualified leader and avoids performance penalties associated with leader changes in schemes such as Paxos.