Simultaneous Consensus is Harder than Set Agreement in Message Passing - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2012

Simultaneous Consensus is Harder than Set Agreement in Message Passing

Zohir Bouzid
  • Function : Author
  • PersonId : 910740

Abstract

In the traditional consensus task, processes are required to agree on a common value chosen among the initial values of the participants. It is well known that consensus cannot be solved in crashed-prone, asynchronous distributed systems. Two generalizations of the consensus problem have been introduced: k-set agreement and k-simultaneous consensus. The k-set agreement task has the same requirements as consensus except that processes are allowed to decide up to k distinct values. In the k-simultaneous consensus task, each process participates simultaneously in k instances of consensus and is required to decide in at least one of them; any two processes deciding in the same instance must decide the same value. It is known that both tasks are equivalent in the wait-free shared memory model. Perhaps surprisingly, the paper shows that this is no longer the case in the n-process asynchronous message passing model with at most t process crashes. Specifically, the paper establishes that for parameters t, n, k such that t > (n+k−2)/2 , k-simultaneous consensus is strictly harder than k-set agreement. The proof compares the information on failures necessary to solve each task in the failure detector framework and relies on a result in topological combinatorics, namely, the chromatic number of Kneser graphs. The paper also introduces the new failure detector class V Σk , which is a generalization of the quorum failures detector class Σ suited to k-simultaneous consensus.
Fichier principal
Vignette du fichier
scsa-main-LONGVERSION.pdf (394.29 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00752610 , version 1 (16-11-2012)
hal-00752610 , version 2 (17-11-2012)

Identifiers

  • HAL Id : hal-00752610 , version 2

Cite

Zohir Bouzid, Corentin Travers. Simultaneous Consensus is Harder than Set Agreement in Message Passing. 2012. ⟨hal-00752610v2⟩
151 View
436 Download

Share

Gmail Facebook X LinkedIn More