Reaching approximate agreement in the presence of faults
Journal of the ACM (JACM)
On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Implementing fault-tolerant services using the state machine approach: a tutorial
ACM Computing Surveys (CSUR)
More choices allow more faults: set consensus problems in totally asynchronous systems
Information and Computation
Impossibility results in the presence of multiple faulty processes
Information and Computation
Sharing memory robustly in message-passing systems
Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Possibility and impossibility results in a shared memory environment
Acta Informatica
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
ACM Transactions on Computer Systems (TOCS)
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Computing Global Functions in Asynchronous Distributed Systems with Perfect Failure Detectors
IEEE Transactions on Parallel and Distributed Systems
Distributed Algorithms
A Layered Analysis of Consensus
SIAM Journal on Computing
Distributed Agreement and Its Relation with Error-Correcting Codes
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Wait-Free n-Set Consensus When Inputs Are Restricted
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
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
Conditions on input vectors for consensus solvability in asynchronous distributed systems
Journal of the ACM (JACM)
The Information Structure of Indulgent Consensus
IEEE Transactions on Computers
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Condition-based consensus solvability: a hierarchy of conditions and efficient protocols
Distributed Computing
Condition Adaptation in Synchronous Consensus
IEEE Transactions on Computers
A weakly-adaptive condition-based consensus algorithm in asynchronous distributed systems
Information Processing Letters
One-step consensus solvability
DISC'06 Proceedings of the 20th international conference on Distributed Computing
No Double Discount: Condition-Based Simultaneity Yields Limited Gain
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
No double discount: Condition-based simultaneity yields limited gain
Information and Computation
All-to-All gradecast using coding with byzantine failures
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Hi-index | 14.98 |
The condition-based approach identifies sets of input vectors, called conditions, for which it is possible to design an asynchronous protocol solving a distributed problem despite process crashes. This paper establishes a direct correlation between distributed agreement problems and error-correcting codes. In particular, crash failures in distributed agreement problems correspond to erasure failures in error-correcting codes and Byzantine and value domain faults correspond to corruption errors. This correlation is exemplified by concentrating on two well-known agreement problems, namely, consensus and interactive consistency, in the context of the condition-based approach. Specifically, the paper presents the following results: First, it shows that the conditions that allow interactive consistency to be solved despite f_{c} crashes and f_{e} value domain faults correspond exactly to the set of error-correcting codes capable of recovering from f_{c} erasures and f_{e} corruptions. Second, the paper proves that consensus can be solved despite f_{c} crash failures iff the condition corresponds to a code whose Hamming distance is f_{c} + 1 and Byzantine consensus can be solved despite f_{b} Byzantine faults iff the Hamming distance of the code is 2f_{b} + 1. Finally, the paper uses the above relations to establish several results in distributed agreement that are derived from known results in error-correcting codes and vice versa.