A general lock-free algorithm using compare-and-swap

[1]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[2]  Martín Abadi,et al.  The existence of refinement mappings , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[3]  Grzegorz Rozenberg,et al.  Stepwise Refinement of Distributed Systems Models, Formalisms, Correctness , 1989, Lecture Notes in Computer Science.

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

[5]  Calton Pu,et al.  A Lock-Free Multiprocessor OS Kernel , 1992, OPSR.

[6]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

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

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

[9]  Brian N. Bershad,et al.  Practical considerations for non-blocking concurrent objects , 1993, [1993] Proceedings. The 13th International Conference on Distributed Computing Systems.

[10]  Leslie Lamport,et al.  The temporal logic of actions , 1994, TOPL.

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

[12]  Mark Moir.  Practical implementations of non-blocking synchronization primitives , 1997, PODC '97.

[13]  Jan Friso Groote,et al.  Wait-free concurrent memory management by Create and Read until Deletion (CaRuD) , 2001, Distributed Computing.

[14]  Maged M. Michael.  Safe memory reclamation for dynamic lock-free objects using atomic reads and writes , 2002, PODC '02.

[15]  Maurice Herlihy,et al.  The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures , 2002, DISC.

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

[17]  Nir Shavit,et al.  Split-ordered lists: lock-free extensible hash tables , 2003, PODC '03.

[18]  Mark Moir,et al.  Nonblocking k-compare-single-swap , 2003, SPAA '03.

[19]  Prasad Jayanti,et al.  Efficient and practical constructions of LL/SC variables , 2003, PODC '03.

[20]  Hui Gao,et al.  Lock-free dynamic hash tables with open addressing , 2003, Distributed Computing.

[21]  Maurice Herlihy,et al.  Bringing practical lock-free synchronization to 64-bit applications , 2004, PODC '04.

[22]  L. Cruz-Filipe,et al.  A formal reduction for lock-free parallel algorithms , 2004 .

[23]  Maged M. Michael.  Practical Lock-Free and Wait-Free LL/SC/VL Implementations Using 64-Bit CAS , 2004, DISC.

[24]  Hui Gao,et al.  Lock-Free Parallel Garbage Collection , 2005, ISPA.