Concurrent data structure: Difference between revisions

Revision as of 19:06, 23 April 2010

Revision as of 23:08, 23 May 2010

Line 13:

Today, as [[multiprocessor]] computer architectures that provide

[[parallel computing|parallelism]] become the dominant computing platform (through the

proliferation of [[multi-core]] processors), the term has come to

stand mainly for data structures that can be accessed by multiple

Line 21:

environment called [[shared memory]], though this memory may be

physically implemented as either a "tightly coupled" or a

[[distributed]] collection of storage modules.

==Basic principles==

Line 50:

The type of liveness requirements tend to define the data structure.

The [[method (computer science)|method]] calls can be '''blocking''' or '''non-blocking'''

(see [[non-blocking synchronization]]). Data structures are not

restricted to one type or the other, and can allow combinations