2011 DataStructuresintheMulticoreAge

• (Shavit, 2011) ⇒ Nir Shavit. (2011). “Data Structures in the Multicore Age.” In: Communications of the ACM, 54(3). doi:10.1145/1897852.1897873

Subject Headings:

Cited By

• http://scholar.google.com/scholar?q=%22Data+structures+in+the+multicore+age%22+2011
• http://dl.acm.org/citation.cfm?doid=1897852.1897873&preflayout=flat#citedby

Quotes

Sidebar: Key insights

• We are experiencing a fundamental shift in the properties required of concurrent data structures and of the algorithms at the core of their implementation.
• The data structures of our childhood — stacks, queues, and heaps — will soon disappear, replaced by looser "unordered" concurrent constructs based on distribution and randomization.
• Future software engineers will need to learn how to program using these novel structures, understanding their performance benefits and their fairness limitations.

References

,

	Author	volume	Date Value	title	type	journal	titleUrl	doi	note	year
2011 DataStructuresintheMulticoreAge	Nir Shavit			Data Structures in the Multicore Age				10.1145/1897852.1897873