Brief announcement: early decision despite general process omission failures
Proceedings of the twenty-second annual symposium on Principles of distributed computing
A Consensus Protocol for CAN-Based Systems
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Optimal early stopping uniform consensus in synchronous systems with process omission failures
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
The combined power of conditions and failure detectors to solve asynchronous set agreement
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Condition Adaptation in Synchronous Consensus
IEEE Transactions on Computers
The perfectly synchronized round-based model of distributed computing
Information and Computation
Adaptive timeliness of consensus in presence of crash and timing faults
Journal of Parallel and Distributed Computing
An Adaptive Programming Model for Fault-Tolerant Distributed Computing
IEEE Transactions on Dependable and Secure Computing
Message and time efficient consensus protocols for synchronous distributed systems
Journal of Parallel and Distributed Computing
No Double Discount: Condition-Based Simultaneity Yields Limited Gain
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Revisiting simultaneous consensus with crash failures
Journal of Parallel and Distributed Computing
Realistic Failures in Secure Multi-party Computation
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Narrowing power vs efficiency in synchronous set agreement: Relationship, algorithms and lower bound
Theoretical Computer Science
On the probabilistic omission adversary
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
The price of anonymity: optimal consensus despite asynchrony, crash and anonymity
DISC'09 Proceedings of the 23rd international conference on Distributed computing
The failure detector abstraction
ACM Computing Surveys (CSUR)
The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash, and Anonymity
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Synchronous consensus under hybrid process and link failures
Theoretical Computer Science
Consensus vs. broadcast in communication networks with arbitrary mobile omission faults
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Early-stopping k-set agreement in synchronous systems prone to any number of process crashes
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
An improved algorithm for adaptive condition-based consensus
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
| Hi-index | 0.00 |
This paper is on consensus protocols for synchronoussystems where processes can commit crash failures, omission failures or Byzantine failures. Is presents and revisitsconsensus protocols coping with such failures in an increasing order of difficulty.The paper can be seen as a short tutorial whose aim is to make the reader familiar with synchrony assumptions, different definitions of the consensusproblem, and a hierarchy of process failure models. An important concern of the paper lies in simplicity. In additionto the survey flavor of the paper, several results that arepresented are new, among which the ones concerning theomission failure model.