Condition Adaptation in Synchronous Consensus

  • Authors:

  • Taisuke Izumi;Toshimitsu Masuzawa

  • Affiliations:

  • IEEE;IEEE

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 2006

Quantified Score

Hi-index 14.98

Visualization

Abstract

The condition-based approach is one of the sophisticated methods used to overcome several impossibility results in the distributed consensus problem (e.g., impossibility of fault tolerance in asynchronous consensus or time complexity lower bounds in synchronous consensus). It introduces conditions on input vectors to specify subsets of all possible input vectors to consensus algorithms and condition-based algorithms can circumvent the impossibility if actual input vectors satisfy a particular condition. In this paper, we present a new condition-based paradigm for synchronous consensus. We introduce the new concept of adaptation on the time complexity of condition-based algorithms and present the adaptive condition-based approach to synchronous consensus. In our approach, all possible input vectors are classified into hierarchical conditions according to their difficulty called the legality level. The execution time of adaptive condition-based algorithms depends on the legality level of input vectors. We propose two adaptive condition-based algorithms for synchronous consensus. The first algorithm requires that the majority of processes be correct, and terminates within \min\{f + 2, t+ 1\} - l rounds if l