Linear Space Bootstrap Communication Schemes

We consider a system of n processes with ids not a priori known, that are drawn from a large space, potentially unbounded. How can these n processes communicate to solve a task? We show that n a priori allocated Multi-Writer Multi-Reader (MWMR) registers are both needed and sufficient to solve any read-write wait free solvable task. This contrasts with the existing possible solution borrowed from adaptive algorithms that require Θ(n 2) MWMR registers.

[1]  Faith Ellen,et al.  Space-optimal multi-writer snapshot objects are slow , 2002, PODC '02.

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

[3]  Faith Ellen,et al.  Time-space tradeoffs for implementations of snapshots , 2006, STOC '06.

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

[5]  Sam Toueg,et al.  Time and Space Lower Bounds for Nonblocking Implementations , 2000, SIAM J. Comput..

[6]  Marcos K. Aguilera,et al.  A pleasant stroll through the land of infinitely many creatures , 2004, SIGA.

[7]  Hagit Attiya,et al.  Algorithms adapting to point contention , 2003, JACM.

[8]  Yehuda Afek,et al.  Long-lived adaptive collect with applications , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[9]  Hagit Attiya,et al.  An adaptive collect algorithm with applications , 2002, Distributed Computing.

[10]  Hagit Attiya,et al.  Polylogarithmic concurrent data structures from monotone circuits , 2012, JACM.

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

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

[13]  Leslie Lamport,et al.  Interprocess Communication , 2020, Practical System Programming with C.

[14]  Carole Delporte-Gallet,et al.  Linear space bootstrap communication schemes , 2015, Theor. Comput. Sci..

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

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

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

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

[19]  Nancy A. Lynch,et al.  Bounds on Shared Memory for Mutual Exclusion , 1993, Inf. Comput..

[20]  Eugene Styer,et al.  Tight bounds for shared memory symmetric mutual exclusion problems , 1989, PODC '89.

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

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

[23]  Yehuda Afek,et al.  Efficient adaptive collect algorithms , 2007, Distributed Computing.

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

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