Concurrent data structure: Difference between revisions

Revision as of 13:44, 30 November 2009

Revision as of 13:46, 30 November 2009

Line 67:

</ref>) specify the structures properties

sequentially, and map its concurrent executions to

a collection of sequential ones. There are various approaches for

doing this, called consistency conditions.

In order to guarantee the safety and liveness properties, concurrent

Line 77 ⟶ 76:

using special primitive synchronization operations (see [[Synchronization (computer science)#Process_synchronization|synchronization primitives]])

available on modern [[multiprocessing | multiprocessor machine]]s

that allow multiple threads to reach consensus. This consensus can be '''blocking''', achieved by using [[Spinlock | locks]] or without locks, in which case it is '''[[non-blocking''' synchronization | non-blocking]]. There is a wide body

of theory on the design of concurrent data structures (see

bibliographical references).