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)
Extended impossibility results for asynchronous complete networks
Information Processing Letters
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
A combinatorial characterization of the distributed 1-solvable tasks
Journal of Algorithms
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
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)
The unified structure of consensus: a layered analysis approach
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Atomic Snapshots in O (n log n) Operations
SIAM Journal on Computing
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
From partial consistency to global broadcast
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Computing Global Functions in Asynchronous Distributed Systems with Perfect Failure Detectors
IEEE Transactions on Parallel and Distributed Systems
Distributed computing: fundamentals, simulations and advanced topics
Distributed computing: fundamentals, simulations and advanced topics
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
Asynchronous interactive consistency and its relation with error-correcting codes
Proceedings of the twenty-first annual symposium on Principles of distributed computing
A Versatile Family of Consensus Protocols Based on Chandra-Toueg's Unreliable Failure Detectors
IEEE Transactions on Computers
Proceedings of the 13th International Symposium on Distributed Computing
Condition-Based Protocols for Set Agreement Problems
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
Unconditional Byzantine Agreement for any Number of Faulty Processors
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Adaptability and the Usefulness of Hints (Extended Abstract)
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
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
A simple and fast asynchronous consensus protocol based on a weak failure detector
Distributed Computing
Early consensus in an asynchronous system with a weak failure detector
Distributed Computing
Wait-Free n-Set Consensus When Inputs Are Restricted
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Conditions on input vectors for consensus solvability in asynchronous distributed systems
Journal of the ACM (JACM)
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
Low complexity Byzantine-resilient consensus
Distributed Computing
Condition Adaptation in Synchronous Consensus
IEEE Transactions on Computers
MIC'06 Proceedings of the 25th IASTED international conference on Modeling, indentification, and control
Asynchronous Agreement and Its Relation with Error-Correcting Codes
IEEE Transactions on Computers
Future directions in distributed computing
One-step consensus solvability
DISC'06 Proceedings of the 20th international conference on Distributed Computing
| Hi-index | 0.01 |
The condition based approach identifies sets of input vectors, called conditions, for which it is possible to design a protocol solving a distributed problem despite process crashes. This paper investigates three related agreement problems, namely consensus, interactive consistency, and k-set agreement, in the context of the condition-based approach. In consensus, processes have to agree on one of the proposed values; in interactive consistency, they have to agree on the vector of proposed values; in k-set agreement, each process decides on one of the proposed values, and at most k different values can be decided on. For both consensus and interactive consistency, a direct correlation between these problems and error correcting codes is established. 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. It is also shown that less restrictive codes can be used to solve k-set agreement, but without a necessity proof, which is still an open problem.