Non-blocking algorithm - Wikipedia

In computer science, an algorithm is called non-blocking if failure or suspension of any thread cannot cause failure or suspension of another thread;[1] 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 pro

[fcicq]

wait-free/lock-free/obstruction-free https://gist.github.com/kumagi/489195

[suffixarray]

[lock] [toprint] non-blocking algo