On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Early stopping in Byzantine agreement
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Sequential consistency versus linearizability
ACM Transactions on Computer Systems (TOCS)
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)
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
Distributed Algorithms
Revistiting the Relationship Between Non-Blocking Atomic Commitment and Consensus
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
PODC '83 Proceedings of the second annual ACM symposium on Principles of 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)
Uniform consensus is harder than consensus
Journal of Algorithms
Brief announcement: the synchronous condition-based consensus hierarchy
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Condition-based consensus solvability: a hierarchy of conditions and efficient protocols
Distributed Computing
Hi-index | 0.00 |
Condition-Based Approach studies restrictions on the inputs of a distributed problem, called conditions, to circumvent several impossibility results. Especially, for the synchronous consensus problem, the relation between conditions and time complexity bounds has been studied. In our previous work [12], we introduced the adaptiveness on time complexity of the condition-based approach, and established the adaptive condition-based approach: It classifies all possible input vectors into the hierarchical sequence of conditions according to their difficulty called legality level. For such hierarchy, adaptive algorithms achieve time complexity depending on the legality level of input vectors. In this paper, we propose an improved version of the adaptive condition-based algorithms for synchronous consensus that achieves better time complexity than the previous one. On the assumption that majority of processes are correct, the proposed algorithm terminates within min{f+2, t+1} rounds if l f, where f and t is the actual and the maximum numbers of faults respectively, and l is the legality level of input vectors. Moreover, the algorithm terminates in 1 round if l ≥ t and f = 0, and terminates within 2 rounds if l ≥ f holds. Compared with our previous algorithm, the proposed algorithm improves time complexity by one round in the case of f = t and l f.