74/2005 : Chasing the Weakest System Model for Implementing Omega and Consensus

RR Number

74/2005

Conference

IEEE Transactions on Dependable and Secure Computing 6(4), 2009, p. 269-281

Author(s)

Martin Hutle, Dahlia Malkhi, Ulrich Schmid, Lidong Zhou

Abstract

Aguilera et al. and Malkhi et al. presented two system models, which are weaker than all previously proposed models where the eventual leader election oracle Omega can be implemented and thus also consensus can be solved. The former model assumes unicast steps and at least one correct process with f outgoing eventually timely links, whereas the latter assumes broadcast steps and at least one correct process with f bidirectional but moving eventually timely links. Consequently, those models are incomparable. In this paper, we show that Omega can also be implemented in a system with at least one process with f outgoing moving eventually timely links, assuming either unicast or broadcast steps. It seems to be the weakest system model that allows to solve consensus via Omega-based algorithms known so far. We also provide matching lower bounds for the communication complexity of Omega in this model, which are based on an interesting "stabilization property" of infinite runs. Those results reveal a fairly high price to be paid for this further relaxation of synchrony properties.

Bibtex

@techreport{HMUZ05:omega_rr,
  author =       "Martin Hutle and Dahlia Malkhi and Ulrich Schmid and Lidong Zhou",
  title =        "Chasing the Weakest System Model for Implementing Omega and Consensus",
  institution =  "Technische Universit{\"a}t Wien, Institut f{\"u}r Technische Informatik",
  address =      "Treitlstr. 1-3/182-2, 1040 Vienna, Austria",
  type =         "Research Report",
  year =         "2005",
  number =       "74/2005"
}

Download

Get paper.pdf - Adobe PDF-format, (1069.25 KB; posted at November 12 2009)