Non-blocking algorithm: Difference between revisions

Revision as of 03:40, 11 December 2006

Revision as of 03:41, 11 December 2006

Line 26:

== Lock-freedom ==

{{main|Lock-free and wait-free algorithms}}

Lock-freedom allows individual threads to starve but guarantees system-wide throughput. An algorithm is lock-free if every step taken achieves global progress (for some sensible definition of progress). All wait-free algorithms are lock-free.