Early deciding synchronous renaming in o( logf) rounds or less

  • Authors:

  • Dan Alistarh;Hagit Attiya;Rachid Guerraoui;Corentin Travers

  • Affiliations:

  • EPFL, Switzerland;Technion, Israel;EPFL, Switzerland;Univ. Bordeaux, France

  • Venue:
  • SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Renaming is a fundamental problem in distributed computing, in which a set of n processes need to pick unique names from a namespace of limited size. In this paper, we present the first early-deciding upper bounds for synchronous renaming, in which the running time adapts to the actual number of failures f in the execution. We show that, surprisingly, renaming can be solved in $\emph{constant}$ time if the number of failures f is limited to $O( \sqrt{n})$, while for general f≤n−1 renaming can always be solved in O( logf) communication rounds. In the wait-free case, i.e. for f=n−1, our upper bounds match the Ω( logn) lower bound of Chaudhuri et al. [13].