Concurrent data structure: Difference between revisions

Revision as of 12:49, 23 November 2009

Revision as of 12:55, 23 November 2009

Line 25:

[[distributed]] collection of storage modules.

==Basic principles==

Concurrent data structures, intended for use in

parallel or distributed computing environments, differ from

"sequential" data structures, intended for use on a uniprocessor

machine, in several ways </ref>) cost per operation.<ref

<ref name="sahni">

{{cite book

| author = Mark Moir and [[Nir Shavit]]

Line 40 ⟶ 42:

| pages = 47-14 — 47-30

}}

</ref><ref name="sahni"/>. Most notably, in a sequential environment

one specifies the data structure's properties and checks that they

are implemented correctly, by providing '''safety properties'''. In

Line 69 ⟶ 71:

== References == {{reflist}}

* [[Nancy Lynch]] "Distributed Computing"

* Hagit Attiya and Jennifer Welch "Distributed Computing: Fundamentals, Simulations And Advanced Topics, 2nd Ed"

* [[Doug Lea]], "Concurrent Programming in Java: Design Principles and Patterns"

* [[Maurice Herlihy]] and [[Nir Shavit]], "The Art of Multiprocessor Programming"

Patterns"

* Mattson, Sanders, and Massingil "Patterns for Parallel Programming"

* [[Maurice Herlihy]] and [[Nir Shavit]], "The Art of Multiprocessor

Programming"

* Mattson, Sanders, and Massingil "Patterns for Parallel

Programming"

==External links==