Eventually consistent failure detectors
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
DISC '01 Proceedings of the 15th 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
Eventually consistent failure detectors
Journal of Parallel and 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
From an intermittent rotating star to a leader
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Implementing the Omega failure detector in the crash-recovery failure model
Journal of Computer and System Sciences
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
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
From an intermittent rotating star to a leader
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Robust stabilizing leader election
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
The failure detector abstraction
ACM Computing Surveys (CSUR)
Eventually consistent failure detectors
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
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
Proactive leader election in asynchronous shared memory systems
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Specifying and implementing an eventual leader service for dynamic systems
International Journal of Web and Grid Services
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
| Hi-index | 0.00 |
The concept of unreliable failure detector was introduced by Chandra and Toueg [2] as a mechanism that provides in-formation about process failures. Depending on the properties the failure detector guarantee, they proposed taxonomy of failure detectors. It has been shown that one of the classes of this taxonomy, namely eventually Strong (3 S), is the weakest class allowing solving the Consensus problem.In this paper, we present a new algorithm implementing 3 S. Our algorithm guarantees that eventually all the correct processes agree on a common correct process. This property trivially allows us to provide the accuracy and completeness properties required by 3 S. We show, then, that our algorithm is better than any other proposed implementation of 3 S in terms of the number of messages and the total amount of information periodically sent. In particular, previous algorithms require to periodically exchanging at least a quadratic amount of information, while ours only requires O(n log n) (where n is the number of processes).However, we also propose a new measure to evaluate the efficiency of this kind of algorithms, the eventual monitoring degree, which does not rely on a periodic behavior and expresses better the degree of processing required by the algorithms. We show that the runs of our algorithm have optimal eventual monitoring degree.