Science Fair Project Encyclopedia
Non-blocking algorithm
In concurrent programming, non-blocking algorithms are those algorithms 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 mechanisms .
Last updated: 05-29-2005 02:37:02
09-23-2007 01:00:40
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details