Knowledge and common knowledge in a distributed environment
Journal of the ACM (JACM)
Early stopping in Byzantine agreement
Journal of the ACM (JACM)
Knowledge and common knowledge in a byzantine environment: crash failures
Information and Computation
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Elements of distributed computing
Elements of distributed computing
Distributed Algorithms
A Layered Analysis of Consensus
SIAM Journal on Computing
On the Impact of Fast Failure Detectors on Real-Time Fault-Tolerant Systems
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Consensus in Synchronous Systems: A Concise Guided Tour
PRDC '02 Proceedings of the 2002 Pacific Rim International Symposium on Dependable Computing
Conditions on input vectors for consensus solvability in asynchronous distributed systems
Journal of the ACM (JACM)
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Reasoning About Knowledge
A bivalency proof of the lower bound for uniform consensus
Information Processing Letters
An Optimal Self-stabilizing Firing Squad
SSS '09 Proceedings of the 11th International Symposium 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
Optimum simultaneous consensus for general omissions is equivalent to an NP oracle
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash, and Anonymity
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
No double discount: Condition-based simultaneity yields limited gain
Information and Computation
An Optimal Self-Stabilizing Firing Squad
SIAM Journal on Computing
Hi-index | 0.00 |
This paper addresses the ''consensus with simultaneous decision'' problem in a synchronous system prone to t process crashes. This problem requires that all the processes that do not crash decide on the same value (consensus), and that all decisions are made during the very same round (simultaneity). So, there is a double agreement, one on the decided value (data agreement) and one on the decision round (time agreement). This problem was first defined by Dwork and Moses who analyzed it and solved it using an analysis of the evolution of states of knowledge in a system with crash failures. The current paper presents a simple algorithm that optimally solves simultaneous consensus. Optimality means in this case that the simultaneous decision is taken in each and every run as soon as any protocol decides, given the same failure pattern and initial value. The design principle of this algorithm is simplicity, a first-class criterion. A new optimality proof is given that is stated in purely combinatorial terms.