papers-we-love_papers-we-love/non_blocking_algorithms/README.md

Non-Blocking Algorithmics

An non-blocking algorithm is an algorithm in which failure or suspension of any thread cannot cause failure or suspension of another thread; for some operations, these algorithms provide a useful alternative to traditional blocking implementations. A non-blocking algorithm is lock-free if there is guaranteed system-wide progress, and wait-free if there is also guaranteed per-thread progress.

Included Papers

• 📜 A Wait-Free Stack (2015) (Seep Goel, Pooja Aggarwal, Smruti R. Sarangi)
• 📜 A Wait-free Queue as Fast as Fetch-and-Add (2016) (Chaoran Yang, John Mellor-Crummey)
• 📜 Efficient Lock-free B+trees (2014) (Lars Frydendal Bonnichsen, Sven Karlsson, Christian W. Probst)