Lock-free linked lists using compare-and-swap

DOI10.1145/224964.224988MaRDI QIDQ5361457zbMATH OpenOpenAlexFDO

Authors John D. Valois

Publication date 29 September 2017

Published in Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing - PODC '95 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/224964.224988

Mathematics Subject Classification ID

Distributed systems (68M14) Data structures (68P05)

Cited in

(11)

• Lock-free dynamic hash tables with open addressing
• An optimistic approach to lock-free FIFO queues
• A concurrent implementation of skip graphs
• Lower bounds on the amortized time complexity of shared objects
• Lock-free deques and doubly linked lists
• Lock-free reference counting
• NB{\texttt{malloc}}: Allocating memory in a lock-free manner
• TSLQueue: an efficient lock-free design for priority queues
• Lower bounds on the amortized time complexity of shared objects
• Concurrent encrypted multimaps
• Locksynth: deriving synchronization code for concurrent data structures with ASP

This page was built for publication: Lock-free linked lists using compare-and-swap

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361457)