Lock-free linked lists using compare-and-swap

DOI10.1145/224964.224988zbMath1373.68200OpenAlexW2062678317MaRDI QIDQ5361457

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

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

Related Items (7)

Unnamed Item ⋮ Lock-free deques and doubly linked lists ⋮ Lock-free dynamic hash tables with open addressing ⋮ An optimistic approach to lock-free FIFO queues ⋮ Lock-free reference counting ⋮ NB{\texttt{malloc}}: Allocating memory in a lock-free manner ⋮ A Concurrent Implementation of Skip Graphs

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