The RedBlue Adaptive Universal Constructions

We present the family of RedBlue algorithms, a collection of universal wait-free constructions for linearizable shared objects in an asynchronous shared-memory distributed system with n processes. The algorithms are adaptive and improve upon previous algorithms in terms of their time and/or space complexity. The first of the algorithms achieves better time complexity than all previously presented algorithms but it is impractical since it uses large LL/SC registers. This algorithm comprises the keystone for the design of the other RedBlue algorithms which are of practical interest. The second algorithm significantly reduces the size of the required registers and it is therefore practical in many cases. The last two algorithms work efficiently for large objects improving previous universal constructions for large objects presented by Anderson and Moir (PODC 1995).

[1]  Mark Moir,et al.  Universal constructions for multi-object operations , 1995, PODC '95.

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

[3]  Prasad Jayanti,et al.  On the Power of Multi-objects , 1997, WDAG.

[4]  Prasad Jayanti,et al.  Efficient Wait-Free Implementation of Multiword LL/SC Variables , 2005, 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05).

[5]  Maurice Herlihy,et al.  Space and Time Adaptive Non-blocking Algorithms , 2003, Electron. Notes Theor. Comput. Sci..

[6]  Yehuda Afek,et al.  Disentangling multi-object operations (extended abstract) , 1997, PODC '97.

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

[8]  Yehuda Afek,et al.  The Power of Multiobjects , 1999, Inf. Comput..

[9]  Yehuda Afek,et al.  Wait-free made fast , 1995, STOC '95.

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

[11]  Prasad Jayanti.  f-arrays: implementation and applications , 2002, PODC '02.

[12]  Tushar Deepak Chandra,et al.  A polylog time wait-free construction for closed objects , 1998, PODC '98.

[13]  Mark Moir,et al.  Universal Constructions for Large Objects , 1995, IEEE Trans. Parallel Distributed Syst..

[14]  Greg Barnes,et al.  A method for implementing lock-free shared-data structures , 1993, SPAA '93.

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

[16]  Gadi Taubenfeld,et al.  Disentangling Multi-object Operations , 1997 .

[17]  Maurice Herlihy,et al.  A methodology for implementing highly concurrent data objects , 1993, TOPL.

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

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

[20]  Yehuda Afek,et al.  Bounds on the shared memory requirements for long-lived & adaptive objects (extended abstract) , 2000, PODC '00.