论文信息 - Wait-free linked-lists

Wait-free linked-lists

The linked-list data structure is fundamental and ubiquitous. Lock-free versions of the linked-list are well known. However, the existence of a practical wait-free linked-list has been open. In this work we designed such a linked-list. To achieve better performance, we have also extended this design using the fast-path-slow-path methodology. The resulting implementation achieves performance which is competitive with that of Harris's lock-free list, while still guaranteeing non-starvation via wait-freedom. We have also developed a proof for the correctness and the wait-freedom of our design.

Erez Petrank | Alex Kogan | Anastasia Braginsky | Shahar Timnat

[1] Maged M. Michael,et al. High performance dynamic lock-free hash tables and list-based sets , 2002, SPAA '02.

[2] Faith Ellen,et al. A universal construction for wait-free transaction friendly data structures , 2010, SPAA '10.

[3] Eric Ruppert,et al. Lock-free linked lists and skip lists , 2004, PODC '04.

[4] Maged M. Michael. Hazard pointers: safe memory reclamation for lock-free objects , 2004, IEEE Transactions on Parallel and Distributed Systems.

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

[6] Timothy L. Harris,et al. A Pragmatic Implementation of Non-blocking Linked-Lists , 2001, DISC.

[7] Panagiota Fatourou,et al. A highly-efficient wait-free universal construction , 2011, SPAA '11.

[8] Erez Petrank,et al. Wait-Free Linked-Lists , 2012, OPODIS.

[9] John D. Valois. Lock-free linked lists using compare-and-swap , 1995, PODC '95.

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

[11] Erez Petrank,et al. A methodology for creating fast wait-free data structures , 2012, PPoPP '12.

[12] Erez Petrank,et al. Wait-free queues with multiple enqueuers and dequeuers , 2011, PPoPP '11.