On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
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)
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
"Gamma-Accurate" Failure Detectors
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Heartbeat: A Timeout-Free Failure Detector for Quiescent Reliable Communication
WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
Non blocking atomic commitment with an unreliable failure detector
SRDS '95 Proceedings of the 14TH Symposium on Reliable Distributed Systems
SRDS '96 Proceedings of the 15th Symposium on Reliable Distributed Systems
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Eventually consistent failure detectors
Journal of Parallel and Distributed Computing
SMS based group communication system for mobile devices
Proceedings of the Ninth ACM International Workshop on Data Engineering for Wireless and Mobile Access
Eventually consistent failure detectors
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
On the impossibility of implementing perpetual failure detectors in partially synchronous systems
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Distributed group communication system for mobile devices based on SMS
From active data management to event-based systems and more
Building a peer-to-peer overlay for efficient routing and low maintenance
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous 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
Algorithms for extracting timeliness graphs
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
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
| Hi-index | 0.00 |
Unreliable failure detectors, proposed by Chandra and Toueg [2], are mechanisms that provide information about process failures. In [2], eight classes of failure detectors were defined, depending on how accurate this information is, and an algorithm implementing a failure detector of one of these classes in a partially synchronous system was presented. This algorithm is based on all-to-all communication, and periodically exchanges a number of messages that is quadratic on the number of processes. To our knowledge, no other algorithm implementing these classes of unreliable failure detectors has been proposed. In this paper, we present a family of distributed algorithms that implement four classes of unreliable failure detectors in partially synchronous systems. Our algorithms are based on a logical ring arrangement of the processes, which defines the monitoring and failure information propagation pattern. The resulting algorithms periodically exchange at most a linear number of messages.