Randomized naming using wait-free shared variables

  • Authors:

  • Alessandro Panconesi;Marina Papatriantafilou;Philippas Tsigas;Paul Vitányi

  • Affiliations:

  • BRICS, Department of Computer Science, University of Aarhus, Building 540, Ny Munkegade, DK-8000 Aarhus C, Denmark;Computing Science Department, Chalmers University of Technology, S-412 96 Göteborg, Sweden;Computing Science Department, Chalmers University of Technology, S-412 96 Göteborg, Sweden;CWI, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands

  • Venue:
  • Distributed Computing
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

A naming protocol assigns unique names (keys) to every process out of a set of communicating processes. We construct a randomized wait-free naming protocol using wait-free atomic read/write registers (shared variables) as process intercommunication primitives. Each process has its own private register and can read all others. The addresses/names each one uses for the others are possibly different: Processes p and q address the register of process r in a way not known to each other. For n processes and ε 0, the protocol uses a name space of size (1 + ε)n and O(n log n log log n) running time (read/writes to shared bits) with probability at least 1-o(1), and O(nlog2n) overall expected running time. The protocol is based on the wait-free implementation of a novel α-Test&SetOnce object that randomly and fast selects a winner from a set of q contenders with probability at least α in the face of the strongest possible adaptive adversary.