Further reading

• Hazard Pointers: Safe Memory Reclamation for Lock-Free Objects, Maged Michael. This paper introduces the hazard-pointer reclamation technique discussed in this chapter. The paper specifically discusses the newly invented technique in comparison to reference counting and demonstrates the construction of a safe Michael and Scott queue using the hazard pointer technique.
• Practical Lock-Freedom, Keir Fraser. This is Keir Fraser's PhD thesis and is quite long, being concerned with the introduction of abstractions to ease the writing of lock-free structures—one of which is epoch-based reclamation—and the introduction of lock-free search structures, skip-lists, binary search trees, and red-black trees. Warmly recommended.
• Performance of Memory Reclamation for Lockless Synchronization, Thomas Hart et al. This paper provides an overview of four techniques, all of which were discussed in passing in Chapter 6, Atomics – the Primitives of Synchronization, of this book, and three of which...