Randomized Wait-Free Naming

We present new distributed randomized naming protocols improving previous results in renaming and unique processor identity protocols. They are wait-free (which implies maximal fault-tolerance) and allow stronger adversaries. They also have low complexity. We give the first wait-free protocol achieving optimal key space range. (This is impossible for deterministic wait-free methods, so we use randomization.) We also introduce a novel wait-free object, a test-and-set object which upon invocation succeeds with probability less than 1, and we give a low complexity implementation of such objects. AMS Subject Classification (1991): 68M10, 68Q22, 68Q25 CR Subject Classification (1991): B.3.2, D.4.1, D.4.5, G.3 Keywords & Phrases: Asynchrony, Distributed Computing, Fault-tolerance, Naming, Processor Identities, Randomized Algorithms, Renaming, Shared Memory Systems, TestAndSet Objects Note: Partially supported by NWO through NFI Project ALADDIN under Contract number NF 62-376; the first a..

Randomized wait-free naming

We present new distributed randomized naming protocols improving previous results in renaming and unique processor identity protocols. They are wait-free (which implies maximal fault-tolerance) and allow stronger adversaries. They also have low complexity. We give the first wait-free protocol achieving optimal key space range. (This is impossible for deterministic wait-free methods, so we use randomization.) We also introduce a novel wait-free object, a test-and-set object which upon invocation succeeds with probability less than 1, and we give a low complexity implementation of such objects

Randomized Naming Using Wait-Free Shared Variables

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 ffl ? 0, the protocol uses a name space of size (1 + ffl)n and O(n log n log log n) running time (read/writes to shared bits) with probability at least 1 \Gamma o(1), and O(n log 2 n) overall expected running time. The protocol is based on the wait-free implementation of a novel ff-Test&SetOnce object that randomly and fast selects a winner from a set of q contenders with probability at least ff in the face of the strongest possible adaptive adversary. Keywords: Naming problem, Symmetr..

Randomized Naming using . . .

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(n log² n) 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