Consensus in the presence of partial synchrony
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)
ACM Transactions on Computer Systems (TOCS)
Information Processing Letters
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Consensus in Asynchronous Systems Where Processes Can Crash and Recover
SRDS '98 Proceedings of the The 17th IEEE Symposium on Reliable Distributed Systems
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
Communication-efficient leader election and consensus with limited link synchrony
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Crash-Resilient Time-Free Eventual Leadership
SRDS '04 Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems
Failure detection and consensus in the crash-recovery model
Distributed Computing
Eventually consistent failure detectors
Journal of Parallel and Distributed Computing
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
Implementing unreliable failure detectors with unknown membership
Information Processing Letters
End-to-end consensus using end-to-end channels
PRDC '06 Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing
Minimal System Conditions to Implement Unreliable Failure Detectors
PRDC '06 Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing
Research note: From ♢W to Ω: A simple bounded quiescent reliable broadcast-based transformation
Journal of Parallel and Distributed Computing
On the implementation of the Omega failure detector in the crash-recovery failure model
ARES '07 Proceedings of the The Second International Conference on Availability, Reliability and Security
Eventual Leader Election in the Crash-Recovery Failure Model
PRDC '08 Proceedings of the 2008 14th IEEE Pacific Rim International Symposium on Dependable Computing
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
Modular Consensus Algorithms for the Crash-Recovery Model
PDCAT '09 Proceedings of the 2009 International Conference on Parallel and Distributed Computing, Applications and Technologies
From an intermittent rotating star to a leader
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Ω meets paxos: leader election and stability without eventual timely links
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Specifying and implementing an eventual leader service for dynamic systems
International Journal of Web and Grid Services
| Hi-index | 0.00 |
Abstract: This work addresses the leader election problem in partially synchronous distributed systems where processes can crash and recover. More precisely, it focuses on implementing the Omega failure detector class, which provides a leader election functionality, in the crash-recovery failure model. The concepts of communication efficiency and near-efficiency for an algorithm implementing Omega are defined. Depending on the use or not of stable storage, the property satisfied by unstable processes, i.e., those that crash and recover infinitely often, varies. Two algorithms implementing Omega are presented. In the first algorithm, which is communication-efficient and uses stable storage, eventually and permanently unstable processes agree on the leader with correct processes. In the second algorithm, which is near-communication-efficient and does not use stable storage, processes start their execution with no leader in order to avoid the disagreement among unstable processes, that will agree on the leader with correct processes after receiving a first message from the leader.