Everything about Non-blocking linked list

🧭 Start here: a 6-step reading path

1. Read the overview: Non-blocking linked listA 5-minute orientation
2. Pick up a classic book: Java software solutionsThe most-reprinted book on the subject
3. Go sideways: Persistent memoryA closely related topic
4. Go sideways: Double compare-and-swapA closely related topic

🏆 Landmark papers (most cited)

• No matching papers found.

📚 Books worth reading

• Java software solutionsLewis, John, John E. Lewis Ph. D. · 1997
• Apache CookbookKen Coar, Rich Bowen · 2003
• The Conspirators HierarchyJohn Coleman · 1992
• Principles of Distributed SystemsRoberto Baldoni · 2012
• Data structures & algorithms in JavaRobert Lafore · 2003
• The Official Blender 2.3 guideTon Roosendaal, Stefano Selleri · 2004
• The book of wirelessA. Frederick Collins · 1915
• CANCER. Targeting Killer CellsGilbert Mertens · 2009

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• Persistent memory In computer science, persistent memory is any method or apparatus for efficiently storing data structures such that they can continue to be accessed using…
• Double compare-and-swap Double compare-and-swap (DCAS or CAS2) is an atomic primitive proposed to support certain concurrent programming techniques. DCAS takes two not necessarily…
• Mutual exclusion In computer science, mutual exclusion is a property of concurrency control, which is instituted for the purpose of preventing race conditions. It is the…
• Load-link/store-conditional In computer science, load-linked/store-conditional (LL/SC), sometimes known as load-reserved/store-conditional (LR/SC), are a pair of instructions used…
• Skip list In computer science, a skip list (or skiplist) is a probabilistic data structure that allows 𝒪(log⁡n) average complexity for search as well as 𝒪(log⁡n)…
• ABA problem In multithreaded computing, the ABA problem occurs during synchronization, when a location is read twice, has the same value for both reads, and the read…
• Ctrie A concurrent hash-trie or Ctrie is a concurrent thread-safe lock-free implementation of a hash array mapped trie. It is used to implement the concurrent…
• Compare-and-swap In computer science, compare-and-swap (CAS) is an atomic instruction used in multithreading to achieve synchronization. It compares the contents of a memory…