Randomized loose renaming in o(log log n) time

Renaming is a classic distributed coordination task in which a set of processes must pick distinct identifiers from a small namespace. In this paper, we consider the time complexity of this problem when the namespace is linear in the number of participants, a variant known as loose renaming. We give a non-adaptive algorithm with O( log log n ) (individual) step complexity, where n is a known upper bound on contention, and an adaptive algorithm with step complexity O((log log k)2 ), where k is the actual contention in the execution. We also present a variant of the adaptive algorithm which requires O( k log log k ) total process steps. All upper bounds hold with high probability against a strong adaptive adversary. We complement the algorithms with an Ω(log log n) expected time lower bound on the complexity of randomized renaming using test-and-set operations and linear space. The result is based on a new coupling technique, and is the first to apply to non-adaptive randomized renaming. Since our algorithms use O(n) test-and-set objects, our results provide matching bounds on the cost of loose renaming in this setting.

[1]  Maurice Herlihy,et al.  The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures , 2002, DISC.

[2]  Gary L. Peterson,et al.  The ambiguity of choosing , 1989, PODC '89.

[3]  Paul G. Spirakis,et al.  Space Efficient Hash Tables with Worst Case Constant Access Time , 2003, STACS.

[4]  Hagit Attiya,et al.  Long-lived renaming made adaptive , 1999, PODC '99.

[5]  Sergio Rajsbaum,et al.  New combinatorial topology bounds for renaming: the lower bound , 2010, Distributed Computing.

[6]  Eli Upfal,et al.  Balanced Allocations , 1999, SIAM J. Comput..

[7]  Lisa Higham,et al.  Long-Lived, Fast, Waitfree Renaming with Optimal Name Space and High Throughput , 1998, DISC.

[8]  Faith Ellen,et al.  Fully-adaptive algorithms for long-lived renaming , 2006, Distributed Computing.

[9]  Dan Alistarh,et al.  Sub-logarithmic Test-and-Set against a Weak Adversary , 2011, DISC.

[10]  Danny Dolev,et al.  Shared-memory vs. message-passing in an asynchronous distributed environment , 1989, PODC '89.

[11]  Dan Alistarh,et al.  Fast Randomized Test-and-Set and Renaming , 2010, DISC.

[12]  Leslie Lamport,et al.  Reaching Agreement in the Presence of Faults , 1980, JACM.

[13]  Danny Hendler,et al.  Randomized mutual exclusion with sub-logarithmic RMR-complexity , 2011, Distributed Computing.

[14]  Marina Papatriantafilou,et al.  Randomized naming using wait-free shared variables , 1998, Distributed Computing.

[15]  Andrei Z. Broder,et al.  Multilevel adaptive hashing , 1990, SODA '90.

[16]  Mark Moir,et al.  Wait-Free Algorithms for Fast, Long-Lived Renaming , 1995, Sci. Comput. Program..

[17]  Harald Niederreiter,et al.  Probability and computing: randomized algorithms and probabilistic analysis , 2006, Math. Comput..

[18]  George Giakkoupis,et al.  On the time and space complexity of randomized test-and-set , 2012, PODC '12.

[19]  Yehuda Afek,et al.  Fast, wait-free (2k-1)-renaming , 1999, PODC '99.

[20]  Prasad Jayanti,et al.  A time complexity lower bound for randomized implementations of some shared objects , 1998, PODC '98.

[21]  Maurice Herlihy,et al.  The topological structure of asynchronous computability , 1999, JACM.

[22]  George Giakkoupis,et al.  A tight RMR lower bound for randomized mutual exclusion , 2012, STOC '12.

[23]  Hagit Attiya,et al.  Time Bounds for Decision Problems in the Presence of Timing Uncertainty and Failures , 2001, J. Parallel Distributed Comput..

[24]  Andrew Chi-Chih Yao,et al.  Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[25]  Hagit Attiya,et al.  Adaptive and Efficient Algorithms for Lattice Agreement and Renaming , 2002, SIAM J. Comput..

[26]  Danny Hendler,et al.  Adaptive randomized mutual exclusion in sub-logarithmic expected time , 2010, PODC '10.

[27]  Hagit Attiya,et al.  Renaming in an asynchronous environment , 1990, JACM.

[28]  Wojciech M. Golab,et al.  Linearizable implementations do not suffice for randomized distributed computation , 2011, STOC '11.

[29]  Dan Alistarh,et al.  The Complexity of Renaming , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[30]  Hagit Attiya,et al.  Counting-Based Impossibility Proofs for Renaming and Set Agreement , 2012, DISC.

[31]  Sergio Rajsbaum,et al.  New combinatorial topology bounds for renaming: The upper bound , 2012, JACM.

[32]  Michael A. Bender,et al.  Mutual Exclusion with O(log^2 Log n) Amortized Work , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[33]  Morteza Zadimoghaddam,et al.  Optimal-time adaptive strong renaming, with applications to counting , 2011, PODC '11.