More choices allow more faults: set consensus problems in totally asynchronous systems
Information and Computation
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Asynchronous consensus and broadcast protocols
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)
ACM Transactions on Computer Systems (TOCS)
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
From binary consensus to multivalued consensus in asynchronous message-passing systems
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
Distributed Algorithms
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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
Randomized Multivalued Consensus
ISORC '01 Proceedings of the Fourth International Symposium on Object-Oriented Real-Time Distributed Computing
Crash-quiescent failure detection
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Failure detectors encapsulate fairness
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
| Hi-index | 0.00 |
This paper is an introduction to oracles the aim of which is to help solving distributed computing problems in asynchronous distributed systems prone to process crash failures and fair lossy channels. Actually, the combination of asynchrony and failures makes a lot of problems impossible to solve in unreliable asynchronous distributed systems. Hence, those systems have to be extended with appropriate oracles in order these problems become solvable. Using two such problems (namely, the design of a quiescent uniform reliable broadcast facility, and the consensus problem), this paper presents appropriate oracles allowing to solve these problems. In that sense, the paper is a guided tour to the definition of oracles suited to unreliable asynchronous distributed systems.