Non-blocking algorithm: Difference between revisions

Revision as of 23:16, 12 June 2007

Revision as of 07:02, 17 October 2007

Line 2:

In modern usage, therefore, an algorithm is ''non-blocking'' if the suspension of one or more threads will not stop the potential progress of the remaining threads. They are designed to avoid requiring a [[critical section]]. Often, these algorithms allow multiple processes to make progress on a problem without ever blocking each other. For some operations, these algorithms provide an alternative to [[locking mechanism]]s.

{{Mergefrom|Lock-free and wait-free algorithms|date=January 2007}}

== Motivation ==