Atomic
-
Non-blocking, Lock-free operationsStaticPL/JAVA 2020. 2. 27. 17:50
1. Overview In computer science, an algorithm is called non-blocking if 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..