Upper bound on the complexity of solving hard renaming

  • Authors:

  • Hagit Attiya;Armando Castañeda;Maurice Herlihy;Ami Paz

  • Affiliations:

  • Technion, Haifa, Israel;Technion, Haifa, Israel;Brown University, Providence, USA;Technion, Haifa, Israel

  • Venue:
  • Proceedings of the 2013 ACM symposium on Principles of distributed computing
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

The M-renaming task requires n+1 processes, each starting with a unique input name (from an arbitrary large range), to coordinate the choice of new output names from a range of size M. This paper presents the first upper bound on the complexity of hard renaming, i.e., 2n-renaming, when n+1 is not a prime power. It is known that 2n-renaming can be solved if and only if n+1 is not a prime power; however, the previous proof of the "if" part was non-constructive, involving an approximation theorem; in particular, it did not yield a concrete upper bound on the complexity of the resulting protocol.