Unreliable Failure Detectors with Limited Scope Accuracy and an Application to Consensus

Authors:
Achour Mostéfaoui;Michel Raynal
Affiliations:
-;-
Venue:
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Year:
1999

Citing 8
Cited 4

Agreement is harder than consensus: set consensus problems in totally asynchronous systems

PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Generalized FLP impossibility result for t-resilient asynchronous computations

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
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)
"Gamma-Accurate" Failure Detectors

WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Solving Consensus Using Chandra-Toueg's Unreliable Failure Detectors: A General Quorum-Based Approach

Proceedings of the 13th International Symposium on Distributed Computing
A simple and fast asynchronous consensus protocol based on a weak failure detector

Distributed Computing
Early consensus in an asynchronous system with a weak failure detector

Distributed Computing

Eventually consistent failure detectors

Journal of Parallel and 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
Eventually consistent failure detectors

EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
Ω meets paxos: leader election and stability without eventual timely links

DISC'05 Proceedings of the 19th international conference on Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let the scope of the accuracy property of an unreliable failure detector be the minimum number (k) of processes that may not erroneously suspect a correct process to have crashed. Classical failure detectors implicitly consider a scope equal to n (the total number of processes). This paper investigates accuracy properties with limited scope, thereby giving rise to the Sk and ⋄Sk classes of failure detectors. A reduction protocol transforming any failure detector belonging to Sk (resp. ⋄Sk) into a failure detector (without limited scope) of the class S (resp. ⋄S) is given. This reduction protocol requires f k, where f is the maximum number of process crashes. (This leaves open the problem to prove/disprove that this condition is necessary.) Then, the paper studies the consensus problem in asynchronous distributed message-passing systems equipped with a failure detector of the class ⋄Sk. It presents a simple consensus protocol that is explicitly based on ⋄Sk. This protocol requires f k, n/2).