Lock-free reference counting

DOI10.1007/S00446-002-0079-ZzbMath1448.68088OpenAlexW4246292616MaRDI QIDQ5138383

Mark Moir, David L. Detlefs, Guy L. jun. Steele, Paul A. Martin

Publication date: 3 December 2020

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-002-0079-z

zbMATH Keywords

memory managementdynamic data structuresreference countinglockfree synchronization

Mathematics Subject Classification ID

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

Related Items (2)

The ERA Theorem for Safe Memory Reclamation ⋮ Concurrent linearizable nearest neighbour search in LockFree-kD-tree

Uses Software

• GC

Cites Work

• How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
• Concurrent manipulation of binary search trees
• Multiprocessing compactifying garbage collection
• On-the-fly garbage collection
• Software transactional memory
• Lock-free linked lists using compare-and-swap
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lock-free reference counting