Exploring Gafni's Reduction Land: From Omegak to Wait-Free Adaptive (2p-[p/k])-Renaming Via k-Set Agreement

The adaptive renaming problem consists in designing an algorithm that allows p processes (in a set of n processes) to obtain new names despite asynchrony and process crashes, in such a way that the size of the new renaming space M be as small as possible. It has been shown that M=2p–1 is a lower bound for that problem in asynchronous atomic read/write register systems.

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

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

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

[4]  Michel Raynal,et al.  The Committee Decision Problem , 2006, LATIN.

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

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

[7]  Leslie Lamport,et al.  The part-time parliament , 1998, TOCS.

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

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

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

[11]  Marcos Kiwi,et al.  LATIN 2006: Theoretical Informatics , 2006, Lecture Notes in Computer Science.

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

[13]  Eli Gafni.  Read-Write Reductions , 2006, ICDCN.

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

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

[16]  Sam Toueg,et al.  The weakest failure detector for solving consensus , 1996, JACM.

[17]  Rachid Guerraoui,et al.  The Alpha of Indulgent Consensus , 2007, Comput. J..