No Double Discount: Condition-based Simultaneity Yields Limited Gain

2 ASAP - As Scalable As Possible: foundations of large scale dynamic distributed systems
IRISA-D1 - SYSTÈMES LARGE ÉCHELLE, Inria Rennes – Bretagne Atlantique
Abstract : Assuming each process proposes a value, the consensus problem requires the non-faulty processes to agree on the same value that has to be a proposed value. Solutions to the consensus problem in synchronous systems are based on the round-based model, namely, the progress of the processes is according to synchronous rounds. Simultaneous consensus requires that the non-faulty processes decide not only on the same value, but decide during the very same round. It has been shown by Dwork and Moses that, in a synchronous system prone to t process crashes, the earliest round at which a common decision can be simultaneously obtained is (t+1)-D where D is a non-negative integer determined by the actual failure pattern F. The condition-based approach to solve consensus assumes that the input vector belongs to set C (a set of input vectors satisfying a property called legality). Interestingly, the conditions for synchronou s consensus define a hierarchy of sets of conditions. It has been shown that d+1 is a tight lower bound on the minimal number of rounds for synchronous condition-based consensus (where d characterizes the class of constions the algorithm is instantiated with). This paper considers the synchronous condition-based consensus problem with simultaneous decision. It first presents a simple algorithm that directs the processes to decide simultaneously at the end of the round RS(t,d,F)=min((t+1)-D, d+1) (i.e., RS(t,d,F)=(t+1)-max(D,delta) with delta=t-d). The paper then shows that RS(t,d,F)is a lower bound for the condition-based simultaneous consensus problem. It thus follows that the algorithm designed is optimal in each and every run, and not just in the worst case: For every choice of failure pattern by the adversary (and every input configuration), the algorithm reaches simultaneous as fast as any correct algorithm could do under the same conditions. This shows that, contrary to what could be hoped, when considering condition-based consensus with simultaneous decision, we can benefit from the best of both actual worlds (either the failure world when RS(t,d,F)=(t+1)-D, or the condition world when RS(t,d,F)=d+1), but we cannot benefit from the sum of savings offered by both. Only one discount applies.
Keywords :
Document type :
Reports
Domain :

Cited literature [17 references]

https://hal.inria.fr/inria-00293649
Contributor : Anne Jaigu <>
Submitted on : Monday, July 7, 2008 - 11:20:36 AM
Last modification on : Wednesday, June 16, 2021 - 3:42:08 AM
Long-term archiving on: : Friday, May 28, 2010 - 9:31:31 PM

Files

PI-1898.pdf
Files produced by the author(s)

Identifiers

• HAL Id : inria-00293649, version 1

Citation

Y. Moses, Michel Raynal. No Double Discount: Condition-based Simultaneity Yields Limited Gain. [Research Report] PI 1898, 2008. ⟨inria-00293649⟩

Record views