Easy impossibility proofs for distributed consensus problems
Distributed Computing
On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Impossibility and universality results for wait-free synchronization
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Fast randomized consensus using shared memory
Journal of Algorithms
Time-and space-efficient randomized consensus
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Sharing memory robustly in message-passing systems
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
How Robust Are Distributed Systems?
How Robust Are Distributed Systems?
The consensus problem in fault-tolerant computing
ACM Computing Surveys (CSUR)
The process group approach to reliable distributed computing
Communications of the ACM
Supporting Fault-Tolerant Parallel Programming in Linda
IEEE Transactions on Parallel and Distributed Systems
Byzantine Agreement in the Presence of Mixed Faults on Processors and Links
IEEE Transactions on Parallel and Distributed Systems
Fundamentals of fault-tolerant distributed computing in asynchronous environments
ACM Computing Surveys (CSUR)
IEEE Transactions on Software Engineering
Nest: A Nested-Predicate Scheme for Fault Tolerance
IEEE Transactions on Computers
Avoiding Malicious Byzantine Faults by a New Signature Generation Technique
EDCC-3 Proceedings of the Third European Dependable Computing Conference on Dependable Computing
Consensus service: a modular approach for building agreement protocols in distributed systems
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
A multiple bus broadcast protocol resilient to non-cooperative Byzantine faults
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
Real-time dependable decisions in timed asynchronous distributed systems
WORDS '97 Proceedings of the 3rd Workshop on Object-Oriented Real-Time Dependable Systems - (WORDS '97)
EURASIP Journal on Wireless Communications and Networking
Illustrating the impossibility of crash-tolerant consensus in asynchronous systems
ACM SIGOPS Operating Systems Review
Toward multi-level modeling of robotic sensor networks: a case study in acoustic event monitoring
Proceedings of the 1st international conference on Robot communication and coordination
The failure detector abstraction
ACM Computing Surveys (CSUR)
Experimental evaluation of a failure detection service based on a gossip strategy
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part II
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
| Hi-index | 4.12 |
Known results regarding consensus among processors are surveyed and related to practice. The ideas embodied in the various proofs are explained. The goal is to give practitioners some sense of the system hardware and software guarantees that are required to achieve a given level of reliability and performance. The survey focuses on two categories of failures: fail-stop failures, which occur when processors fail by stopping; and Byzantine failures, which occur when processors fail by acting maliciously.