Content deleted Content added
No edit summary |
→top: {{distinguish}} |
||
Line 1:
{{refimprove|date=August 2010}}
{{tone|date=October 2012}}
{{distinguish|Non-blocking I/O}}
In [[computer science]], a '''non-blocking algorithm''' ensures that [[thread (software engineering)|thread]]s competing for a shared [[resource (computer science)|resource]] do not have their [[execution (computers)|execution]] indefinitely postponed by [[mutual exclusion]]. A non-blocking [[algorithm]] is '''lock-free''' if there is guaranteed system-wide [[Resource starvation|progress]] regardless of [[Scheduling (computing)|scheduling]]; '''wait-free''' if there is also guaranteed per-thread progress.
| |||