Data Structures in the Multicore Age.

The article discusses the use of multicore processors and parallel architectures to improve data structures. It argues that a major shift is underway, as of March 2011, in the properties of concurrent data structures and their implementing algorithms. This is expected to cause data structures such a...

Descripción completa

Detalles Bibliográficos
Publicado en:Communications of the ACM Vol. 54; no. 3; pp. 76 - 85
Autor principal: SHAVIT, NIR
Formato: Artículo
Publicado: Association for Computing Machinery Mar2011
Materias:
Acceso en línea:Ver este registro en EBSCOhost
Descripción
Sumario:The article discusses the use of multicore processors and parallel architectures to improve data structures. It argues that a major shift is underway, as of March 2011, in the properties of concurrent data structures and their implementing algorithms. This is expected to cause data structures such as stacks, queues, and heaps to become obsolete, replaced by looser constructs involving randomization and distribution. Software engineers are advised to familiarize themselves with the performance benefits and limitations this involves.