Distributed agreement in the presence of processor and communication faults
IEEE Transactions on Software Engineering
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Shifting gears: changing algorithms on the fly to expedite Byzantine agreement
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Automatically increasing the fault-tolerance of distributed algorithms
Journal of Algorithms
Early stopping in Byzantine agreement
Journal of the ACM (JACM)
Knowledge and common knowledge in a byzantine environment: crash failures
Information and Computation
On the relationship between the atomic commitment and consensus problems
Fault-tolerant distributed computing
Fault-tolerant broadcasts and multicasts: the problem of inconsistency and contamination
Fault-tolerant broadcasts and multicasts: the problem of inconsistency and contamination
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)
Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Weak Byzantine Generals Problem
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed Algorithms
A Layered Analysis of Consensus
SIAM Journal on Computing
A simple proof of the uniform consensus synchronous lower bound
Information Processing Letters
Revistiting the Relationship Between Non-Blocking Atomic Commitment and Consensus
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
Synchronous System and Perfect Failure Detector: Solvability and Efficiency Issue
DSN '00 Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Polynomial algorithms for multiple processor agreement
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
A Modular Approach to Fault-Tolerant Broadcasts and Related Problems
A Modular Approach to Fault-Tolerant Broadcasts and Related Problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
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
Timeliness, failure-detectors, and consensus performance
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Message and time efficient consensus protocols for synchronous distributed systems
Journal of Parallel and Distributed Computing
A topological treatment of early-deciding set-agreement
Theoretical Computer Science
Narrowing power vs efficiency in synchronous set agreement: Relationship, algorithms and lower bound
Theoretical Computer Science
Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
A bivalency proof of the lower bound for uniform consensus
Information Processing Letters
Making distributed applications robust
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Synchronous consensus under hybrid process and link failures
Theoretical Computer Science
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
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Optimal and practical WAB-based consensus algorithms
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Early-stopping k-set agreement in synchronous systems prone to any number of process crashes
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
An improved algorithm for adaptive condition-based consensus
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Easy impossibility proofs for k-set agreement in message passing systems
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Early-deciding consensus is expensive
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Hi-index | 0.00 |
We compare the consensus and uniform consensus problems in synchronous systems. In contrast to consensus, uniform consensus is not solvable with byzantine failures. This still holds for the omission failure model if a majority of processes may be faulty. For the crash failure model, both consensus and uniform consensus are solvable, no matter how many processes are faulty. In this failure model, We examine the number of rounds required to reach a decision in the consensus and uniform consensus algorithms. We show that if uniform agreement is required, one additional round is needed to decide, and so uniform consensus is also harder than consensus for crash failures. This is based on a new lower bound result for the synchronous model that we state for the uniform consensus problem. Finally, an algorithm is presented that achieves this lower bound.