The renaming problem in shared memory systems: An introduction

Exploring the power of shared memory communication objects and models, and the limits of distributed computability are among the most exciting research areas of distributed computing. In that spirit, this paper focuses on a problem that has received considerable interest since its introduction in 1987, namely the renaming problem. It was the first non-trivial problem known to be solvable in an asynchronous distributed system despite process failures. Many algorithms for renaming and variants of renaming have been proposed, and sophisticated lower bounds have been proved, that have been a source of new ideas of general interest to distributed computing. It has consequently acquired a paradigm status in distributed fault-tolerant computing. In the renaming problem, processes start with unique initial names taken from a large name space, then deciding new names such that no two processes decide the same new name and the new names are from a name space that is as small as possible. This paper presents an introduction to the renaming problem in shared memory systems, for non-expert readers. It describes both algorithms and lower bounds. Also, it discusses strong connections relating renaming and other important distributed problems such as set agreement and symmetry breaking.

[1]  Leslie Lamport,et al.  A fast mutual exclusion algorithm , 1987, TOCS.

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

[3]  Hagit Attiya,et al.  Polynominal and Adaptive Long-Lived (2k-1)-Renaming , 2000, DISC.

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

[5]  Gadi Taubenfeld,et al.  On the Computational Power of Shared Objects , 2009, OPODIS.

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

[7]  Gil Neiger,et al.  Set-linearizability , 1994, PODC '94.

[8]  Eli Gafni,et al.  Renaming with k-Set-Consensus: An Optimal Algorithm into n + k - 1 Slots , 2006, OPODIS.

[9]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1985, JACM.

[10]  Sam Toueg,et al.  Unreliable failure detectors for reliable distributed systems , 1996, JACM.

[11]  Michel Raynal,et al.  Help When Needed, But No More: Efficient Read/Write Partial Snapshot , 2009, DISC.

[12]  Soma Chaudhuri,et al.  More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems , 1993, Inf. Comput..

[13]  Maurice Herlihy,et al.  New Perspectives in Distributed Computing , 1999, MFCS.

[14]  Hagit Attiya,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .

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

[16]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[17]  Michel Raynal,et al.  A Theory-Oriented Introduction to Wait-Free Synchronization Based on the Adaptive Renaming Problem , 2011, 2011 IEEE International Conference on Advanced Information Networking and Applications.

[18]  Maurice Herlihy,et al.  Algebraic spans , 2000 .

[19]  Eli Gafni,et al.  Generalized FLP impossibility result for t-resilient asynchronous computations , 1993, STOC.

[20]  Maurice Herlihy,et al.  Subconsensus Tasks: Renaming Is Weaker Than Set Agreement , 2006, DISC.

[21]  Sergio Rajsbaum,et al.  New combinatorial topology upper and lower bounds for renaming , 2008, PODC '08.

[22]  Michel Raynal,et al.  Test & Set, Adaptive Renaming and Set Agreement: a Guided Visit to Asynchronous Computability , 2007, 2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007).

[23]  Michel Raynal,et al.  Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems , 2010, Synthesis Lectures on Distributed Computing Theory.

[24]  Eli Gafni,et al.  Immediate atomic snapshots and fast renaming , 1993, PODC '93.

[25]  Michael E. Saks,et al.  Wait-free k-set agreement is impossible: the topology of public knowledge , 1993, STOC.

[26]  Michel Raynal,et al.  On Adaptive Renaming under Eventually Limited Contention , 2010, SSS.

[27]  Leslie Lamport,et al.  On interprocess communication , 1986, Distributed Computing.

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

[29]  Hagit Attiya,et al.  Atomic Snapshots in O(n log n) Operations , 1998, SIAM J. Comput..

[30]  Yehuda Afek,et al.  Failure detectors in loosely named systems , 2008, PODC '08.

[31]  Gil Neiger,et al.  Failure Detectors and the Wait-Free Hierarchy. , 1995, ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing.

[32]  Maurice Herlihy,et al.  The art of multiprocessor programming , 2020, PODC '06.

[33]  Maurice Herlihy,et al.  Linearizability: a correctness condition for concurrent objects , 1990, TOPL.

[34]  Michel Rennes.  Failure Detectors for Asynchronous Distributed Systems: An Introduction , 2008, Wiley Encyclopedia of Computer Science and Engineering.

[35]  Gil Neiger.  Failure detectors and the wait-free hierarchy (extended abstract) , 1995, PODC '95.

[36]  Shmuel Zaks,et al.  A Combinatorial Characterization of the Distributed 1-Solvable Tasks , 1990, J. Algorithms.

[37]  Maurice Herlihy,et al.  Obstruction-free synchronization: double-ended queues as an example , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[38]  Maurice Herlihy,et al.  Wait-free synchronization , 1991, TOPL.

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

[40]  Achour Mostéfaoui,et al.  From adaptive renaming to set agreement , 2009, Theor. Comput. Sci..

[41]  Michel Raynal.  Locks Considered Harmful: A Look at Non-traditional Synchronization , 2008, SEUS.

[42]  Eli Gafni,et al.  Recursion in Distributed Computing , 2010, SSS.

[43]  Hagit Attiya,et al.  The Combinatorial Structure of Wait-Free Solvable Tasks , 2002, SIAM J. Comput..

[44]  Maurice Herlihy,et al.  An Overview of Synchronous Message-Passing and Topology , 2000, GETCO.

[45]  Sergio Rajsbaum,et al.  Iterated Shared Memory Models , 2010, LATIN.

[46]  Anne Katz Rn,et al.  A New Perspective , 2003 .

[47]  Yehuda Afek,et al.  Group Renaming , 2008, OPODIS.

[48]  Achour Mostéfaoui,et al.  Exploring Gafni's Reduction Land: From Omegak to Wait-Free Adaptive (2p-[p/k])-Renaming Via k-Set Agreement , 2006, DISC.

[49]  Mark Moir.  Fast, Long-Lived Renaming Improved and Simplified , 1998, Sci. Comput. Program..

[50]  Michel Raynal,et al.  In Search of the Holy Grail: Looking for the Weakest Failure Detector for Wait-Free Set Agreement , 2006, OPODIS.