Non-blocking algorithm: Difference between revisions

Revision as of 15:19, 16 December 2015

Revision as of 18:51, 22 December 2015

Line 20:

Non-blocking algorithms are also safe for use in [[interrupt handler]]s: even though the [[Pre-emptive multitasking|preempted]] thread cannot be resumed, progress is still possible without it. In contrast, global data structures protected by mutual exclusion cannot safely be accessed in an interrupt handler, as the preempted thread may be the one holding the lock.

Some people use aA lock-free data structure incan be orderused to improve performance.

A lock-free data structure increases the amount of time spent in parallel execution rather than serial execution, improving performance on a [[multi-core processor]], because access to the shared data structure does not need to be serialized to stay coherent.<ref>

Guillaume Marçais, and Carl Kingsford.