Concurrent data structure: Difference between revisions

Revision as of 00:24, 15 April 2010

Revision as of 19:06, 23 April 2010

Line 3:

In [[computer science]], a '''concurrent data structure''' is a

particular way of storing and organizing [[data]] for access by

multiple computing [[threads]] (or [[process (computing)|processes]]) on a [[computer]].

Historically, such data structures were used on [[uniprocessor]]

machines with [[operating systems]] that supported multiple

computing threads (or [[process (computing)|processes]]). The term [[concurrency (computer science)|concurrency]] captured the

[[multiplexing]]/[[interleaving]] of the threads' operations on the

data by the operating system, even though the processors never