Automatically increasing the fault-tolerance of distributed algorithms
Journal of Algorithms
Fault-tolerant broadcasts and multicasts: the problem of inconsistency and contamination
Fault-tolerant broadcasts and multicasts: the problem of inconsistency and contamination
Reasoning about knowledge
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
Structured derivations of consensus algorithms for failure detectors
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
A knowledge-theoretic analysis of uniform distributed coordination and failure detectors
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
On the Relationship Between the Atomic Commitment and Consensus Problems
Proceedings of the Asilomar Workshop on Fault-Tolerant Distributed Computing
Reliable Broadcast in Synchronous and Asynchronous Environments (Preliminary Version)
Proceedings of the 3rd International Workshop on Distributed Algorithms
Simulating Crash Failures with Many Faulty Processors (Extended Abstract)
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Using Failure Detectors to Solve Consensus in Asynchronous Sharde-Memory Systems (Extended Abstract)
WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
Simulating Reliable Links with Unreliable Links in the Presence of Process Crashes
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Failure Detection and Consensus in the Crash-Recovery Model
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
A Modular Approach to Fault-Tolerant Broadcasts and Related Problems
A Modular Approach to Fault-Tolerant Broadcasts and Related Problems
Revisiting the Weakest Failure Detector for Uniform Reliable Broadcast
Revisiting the Weakest Failure Detector for Uniform Reliable Broadcast
Eventually consistent failure detectors
Journal of Parallel and Distributed Computing
With Finite Memory Consensus Is Easier Than Reliable Broadcast
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Solving Atomic Multicast When Groups Crash
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
The Minimum Information about Failures for Solving Non-local Tasks in Message-Passing Systems
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
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
Asynchronous failure detectors
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
Uniform Reliable Broadcast (URB) is a communication primitive that requires that if a process delivers a message, then all correct processes also deliver this message. A recent paper [HR99] uses Knowledge Theory to determine what failure detectors are necessary to implement this primitive in asynchronous systems with process crashes and lossy links that are fair. In this paper, we revisit this problem using a different approach, and provide a result that is simpler, more intuitive, and, in a precise sense, more general.