A simple proof of the uniform consensus synchronous lower bound
Information Processing Letters
Conditions on input vectors for consensus solvability in asynchronous distributed systems
Journal of the ACM (JACM)
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Uniform consensus is harder than consensus
Journal of Algorithms
Fast fault-tolerant agreement algorithms
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
A bivalency proof of the lower bound for uniform consensus
Information Processing Letters
Harmful dogmas in fault tolerant distributed computing
ACM SIGACT News
Asynchronous Agreement and Its Relation with Error-Correcting Codes
IEEE Transactions on Computers
Agreement in synchronous networks with ubiquitous faults
Theoretical Computer Science
Message and time efficient consensus protocols for synchronous distributed systems
Journal of Parallel and Distributed Computing
Lower bounds for randomized consensus under a weak adversary
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Tight bounds for asynchronous randomized consensus
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
An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Partial synchrony based on set timeliness
Proceedings of the 28th ACM symposium on Principles of distributed computing
Locally scalable randomized consensus for synchronous crash failures
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
A bivalency proof of the lower bound for uniform consensus
Information Processing Letters
On the probabilistic omission adversary
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Open questions on consensus performance in well-behaved runs
Future directions in distributed computing
Concurrent computing and shellable complexes
DISC'10 Proceedings of the 24th international conference on Distributed computing
Distributed programming with tasks
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
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
Lower Bounds for Randomized Consensus under a Weak Adversary
SIAM Journal on Computing
SIAM Journal on Control and Optimization
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Majority and unanimity in synchronous networks with ubiquitous dynamic faults
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
No double discount: Condition-based simultaneity yields limited gain
Information and Computation
Computability in distributed computing: a Tutorial
ACM SIGACT News
Counting-based impossibility proofs for renaming and set agreement
DISC'12 Proceedings of the 26th international conference on Distributed Computing
| Hi-index | 0.01 |
This paper introduces a simple notion of layering as a tool for analyzing well-behaved runs of a given model of distributed computation. Using layering, a model-independent analysis of the consensus problem is performed and then applied to proving lower bounds and impossibility results for consensus in a number of familiar and less familiar models. The proofs are simpler and more direct than existing ones, and they expose a unified structure to the difficulty of reaching consensus. In particular, the proofs for the classical synchronous and asynchronous models now follow the same outline. A new notion of connectivity among states in runs of a consensus protocol, called potence connectivity, is introduced. This notion is more general than previous notions of connectivity used for this purpose and plays a key role in the uniform analysis of consensus.