Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science on STACS 89
Early stopping in Byzantine agreement
Journal of the ACM (JACM)
Implementing fault-tolerant services using the state machine approach: a tutorial
ACM Computing Surveys (CSUR)
Lightweight causal and atomic group multicast
ACM Transactions on Computer Systems (TOCS)
The weakest failure detector for solving consensus
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Efficient message ordering in dynamic networks
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
The unified structure of consensus: a layered analysis approach
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
A tight lower bound for randomized synchronous consensus
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
ACM Transactions on Computer Systems (TOCS)
The Timed Asynchronous Distributed System Model
IEEE Transactions on Parallel and Distributed Systems
ACM Transactions on Computer Systems (TOCS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Revistiting the Relationship Between Non-Blocking Atomic Commitment and Consensus
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
How to Build a Highly Available System Using Consensus
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
The inherent cost of nonblocking commitment
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
ACM SIGACT news distributed computing column 5
ACM SIGACT News
Evaluating the running time of a communication round over the internet
Proceedings of the twenty-first annual symposium on Principles of distributed computing
A simple proof of the uniform consensus synchronous lower bound
Information Processing Letters
Condition-Based Protocols for Set Agreement Problems
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
A Generic Framework for Indulgent Consensus
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
The Information Structure of Indulgent Consensus
IEEE Transactions on Computers
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Distributed Computing
Proceedings of the 2005 ACM symposium on Applied computing
Local Terminations and Distributed Computability in Anonymous Networks
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Bosco: One-Step Byzantine Asynchronous Consensus
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
A topological treatment of early-deciding set-agreement
Theoretical Computer Science
The Complexity of Early Deciding Set Agreement: How can Topology help?
Electronic Notes in Theoretical Computer Science (ENTCS)
The Complexity of Early Deciding Set Agreement
SIAM Journal on Computing
A topological treatment of early-deciding set-agreement
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Optimal and practical WAB-based consensus algorithms
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
One-step consensus solvability
DISC'06 Proceedings of the 20th international conference on Distributed Computing
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Generating fast atomic commit from hyperfast consensus
LADC'05 Proceedings of the Second Latin-American conference on Dependable Computing
From a store-collect object and Ω to efficient asynchronous consensus
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
| Hi-index | 0.00 |
We consider the consensus problem in an asynchronous model enriched with unreliable failure detectors and in the partial synchrony model. We consider algorithms that solve consensus and tolerate crash failures and/or message omissions. We prove tight lower bounds on the number of communication steps performed by such algorithms in failure-free executions. We present in a unified framework a number of related lower bound results. Thus, we shed light on the relationships among different known lower and upper bounds, and at the same time, illustrate a general technique for obtaining simple and elegant lower bound proofs. We also illustrate matching upper bounds: we algorithms that achieve the lower bound.