Renaming in an asynchronous environment
Journal of the ACM (JACM)
Knowledge and common knowledge in a distributed environment
Journal of the ACM (JACM)
Agreement is harder than consensus: set consensus problems in totally asynchronous systems
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Lower bounds for wait-free computation in message-passing systems
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Knowledge and common knowledge in a byzantine environment: crash failures
Information and Computation
Generalized FLP impossibility result for t-resilient asynchronous computations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Reasoning about knowledge
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)
The topological structure of asynchronous computability
Journal of the ACM (JACM)
Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
SIAM Journal on Computing
Tight bounds for k-set agreement
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
The Combinatorial Structure of Wait-Free Solvable Tasks
SIAM Journal on Computing
Polynomial algorithms for multiple processor agreement
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Conditions on input vectors for consensus solvability in asynchronous distributed systems
Journal of the ACM (JACM)
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
Brief announcement: pareto optimal solutions to consensus and set consensus
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Hi-index | 0.00 |
Decision tasks require that nonfaulty processes make decisions based on their input values. Simultaneous decision tasks require that nonfaulty processes decide in the same round. Most decision tasks have known worst-case lower bounds. Most also have known worst-case optimal protocols that halt in the number of rounds given by the worst-case lower bound, and some have early-stopping protocols that can halt earlier than the worst-case lower bound (sometimes in as early as two rounds). We consider what might be called earliest-possible protocols for simultaneous decision tasks. We present a new technique that converts worst-case optimal decision protocols into all-case optimal simultaneous decision protocols: For every behavior of the adversary, the all-case optimal protocol decides as soon as any protocol can decide in a run with the same adversarial behavior. Examples to which this can be applied include set consensus, condition-based consensus, renaming and order-preserving renaming. Some of these tasks can be solved significantly faster than the classical simultaneous consensus task. A byproduct of the analysis is a proof that improving on the worst-case bound for any simultaneous task by even a single round is as hard as reaching simultaneous consensus.