||7 years ago|
|README.md||7 years ago|
|a-wait-free-queue-as-fast-as-fetch-and-add.pdf||7 years ago|
|a-wait-free-stack.pdf||7 years ago|
|efficient-lock-free-b+trees.pdf||7 years ago|
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.