Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
ACM Transactions on Computer Systems (TOCS)
Performing Work Efficiently in the Presence of Faults
SIAM Journal on Computing
Information Processing Letters
Theoretical Computer Science
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
On the Quality of Service of Failure Detectors
DSN '00 Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8)
Optimal Implementation of the Weakest Failure Detector for Solving Consensus
SRDS '00 Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems
Failure detection and consensus in the crash-recovery model
Distributed Computing
A gossip-style failure detection service
Middleware '98 Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing
On the Impact of Fast Failure Detectors on Real-Time Fault-Tolerant Systems
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
On implementing omega with weak reliability and synchrony assumptions
Proceedings of the twenty-second annual symposium on Principles of distributed computing
On the Implementation of Unreliable Failure Detectors in Partially Synchronous Systems
IEEE Transactions on Computers
Communication-efficient leader election and consensus with limited link synchrony
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Self-Stabilizing Anonymous Leader Election in a Tree
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 8 - Volume 09
Eventually consistent failure detectors
Journal of Parallel and Distributed Computing
Consensus on transaction commit
ACM Transactions on Database Systems (TODS)
An efficient leader election protocol for mobile networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Timeliness, failure-detectors, and consensus performance
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Coordinated data aggregation in wireless sensor networks using the Omega failure detector
Proceedings of the 3rd ACM international workshop on Performance evaluation of wireless ad hoc, sensor and ubiquitous networks
Adaptive timeliness of consensus in presence of crash and timing faults
Journal of Parallel and Distributed Computing
Optimal failure detection with low sporadic overhead and communication locality
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Implementing the Omega failure detector in the crash-recovery failure model
Journal of Computer and System Sciences
Proceedings of the 2009 ACM symposium on Applied Computing
The weakest failure detector for wait-free dining under eventual weak exclusion
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Stabilizing leader election in partial synchronous systems with crash failures
Journal of Parallel and Distributed Computing
A simple and communication-efficient Omega algorithm in the crash-recovery model
Information Processing Letters
OPODIS '09 Proceedings of the 13th 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
Crash-quiescent failure detection
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Brief announcement: an efficient failure detector for omission environments
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The failure detector abstraction
ACM Computing Surveys (CSUR)
Communication-efficient and crash-quiescent Omega with unknown membership
Information Processing Letters
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Communication-efficient failure detection and consensus in omission environments
Information Processing Letters
Snooze: A Scalable, Fault-Tolerant and Distributed Consolidation Manager for Large-Scale Clusters
GREENCOM-CPSCOM '10 Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing
Efficient fault tolerant consensus using preemptive token
ACAI '11 Proceedings of the International Conference on Advances in Computing and Artificial Intelligence
The Asynchronous Bounded-Cycle model
Theoretical Computer Science
Communication-efficient leader election in crash-recovery systems
Journal of Systems and Software
Brief announcement: communication-optimal implementation of failure detector class ⋄P
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Semi-formal development of a fault-tolerant leader election protocol in erlang
FATES'04 Proceedings of the 4th international conference on Formal Approaches to Software Testing
Revisiting failure detection and consensus in omission failure environments
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Ω meets paxos: leader election and stability without eventual timely links
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Communication-efficient implementation of failure detector classes ♦;Q and ♦;P
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Proactive leader election in asynchronous shared memory systems
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Algorithms for extracting timeliness graphs
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
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
Eventually perfect failure detectors using ADD channels
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
On the implementation of communication-optimal failure detectors
LADC'07 Proceedings of the Third Latin-American conference on Dependable Computing
Communication-Efficient self-stabilization in wireless networks
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Leader election for replicated services using application scores
Proceedings of the 12th International Middleware Conference
| Hi-index | 0.00 |
We introduce the notion of stable leader election and derive several algorithms for this problem. Roughly speaking, a leader election algorithm is stable if it ensures that once a leader is elected, it remains the leader for as long as it does not crash and its links have been behaving well, irrespective of the behavior of other processes and links. In addition to being stable, our leader election algorithms have several desirable properties. In particular, they are all communication-efficient, i.e., they eventually use only n links to carry messages, and they are robust, i.e., they work in systems where only the links to/from some correct process are required to be eventually timely. Moreover, our best leader election algorithm tolerates message losses, and it ensures that a leader is elected in constant time when the system is stable. We conclude the paper by applying the above ideas to derive a robust and efficient algorithm for the eventually perfect failure detector lP.