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 rst 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.