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.
| Attributes | Values |
|---|---|
| rdfs:comment |
|
| differentFrom | |
| is known for of |