Reaching approximate agreement in the presence of faults
Journal of the ACM (JACM)
A hundred impossibility proofs for distributed computing
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Tight bounds for the sequence transmission problem
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
A combinatorial characterization of the distributed 1-solvable tasks
Journal of Algorithms
The impossibility of implementing reliable communication in the face of crashes
Journal of the ACM (JACM)
More choices allow more faults: set consensus problems in totally asynchronous systems
Information and Computation
Reliable communication over unreliable channels
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)
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
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
Failure Detection and Randomization: A Hybrid Approach to Solve Consensus
SIAM Journal on Computing
Restricted failure detectors: definition and reduction protocols
Information Processing Letters
k-set agreement with limited accuracy failure detectors
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Computing Global Functions in Asynchronous Distributed Systems with Perfect Failure Detectors
IEEE Transactions on Parallel and Distributed Systems
On Quiescent Reliable Communication
SIAM Journal on Computing
Distributed computing: fundamentals, simulations and advanced topics
Distributed computing: fundamentals, simulations and advanced topics
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Conditions on input vectors for consensus solvability in asynchronous distributed systems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A hierarchy of conditions for consensus solvability
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Distributed Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Simulating Reliable Links with Unreliable Links in the Presence of Process Crashes
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Condition-Based Protocols for Set Agreement Problems
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
The Best of Both Worlds: A Hybrid Approach to Solve Consensus
DSN '00 Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8)
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
This paper is a short and informal introduction to failure detector oracles for asynchronous distributed systems prone to process crashes and fair lossy channels. A distributed coordination problem (the implementation of Uniform Reliable Broadcast with a quiescent protocol) is used as a paradigm to visit two types of such oracles. One of them is a "guessing" oracle in the sense that it provides a process with information that the processes could only approximate if they had to compute it. The other is a "hiding" oracle in the sense that it allows to isolate and encapsulate the part of a protocol that has not the required behavioral properties. A quiescent uniform reliable broadcast protocol is described. The guessing oracle is used to ensure the "uniformity" requirement stated in the problem specification. The hiding oracle is used to ensure the additional "quiescence" property that the protocol behavior has to satisfy.