Consensus in One Communication Step

One-step Consensus with Zero-Degradation

“…Brasileiro's [2] one-step consensus algorithm has a preliminary voting phase in which processes exchange their proposals. If a process receives enough equal values it decides, otherwise it uses an underlying consensus module.…”

“…In the literature such algorithms are called onestep. The original idea of consensus in one communication step stems from Brasileiro [2]. While his solution is optimal for this particular case, his protocol needs at least three communication rounds starting from other configurations.…”

Generating Fast Atomic Commit from Hyperfast Consensus

“…In a recent publication [Lam04], Lamport has pointed out the interest in studying new pertinent consensus definitions as a way for breaking the limit on message delays. In [BGMR01,Gre02], one of the authors proposed new consensus assumptions giving rise to hyperfast consensus algorithms, that allow the learning of decided values within only one communication step. Those assumptions basically consist in enriching the initial knowledge of processes with an a priori agreement, besides the pair (n, f ).…”

“…Correctness proof of AC-Value is similar and thus it will not be described here. In the following, we are assuming the correction of Set Consensus [BGMR01,Gre02]. Theorem 1.…”

“…AC-Set (respectively AC-Value) relies on a hyperfast consensus protocol, called Set-Consensus (respectively Val-Consensus). These two consensus have been proposed by one of the authors in [BGMR01,Gre02]. They introduce new consensus assumptions giving rise to hyperfast algorithms, that allow the learning of decided values within one communication step.…”