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...

Full description

Bibliographic Details
Published in:Communications of the ACM Vol. 54; no. 3; pp. 76 - 85
Main Author: SHAVIT, NIR
Format: Article
Published: Association for Computing Machinery Mar2011
Subjects:
Online Access:View this record in EBSCOhost
fields @attributes:
  recordID: 1
pdfLink:
plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=59423981&site=ehost-live
header:
  @attributes:
    shortDbName: hlh
    uiTerm: 59423981
    longDbName: Humanities International Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        00010782
        ACM
      jtl: Communications of the ACM
      issn: 00010782
      maglogo: N
    pubinfo:
      dt: Mar2011
      vid: 54
      iid: 3
      pid: 68
      pub: Association for Computing Machinery
    artinfo:
      ui:
        59423981
        10.1145/1897852.1897873
      ppf: 76
      ppct: 9
      formats:
      tig:
        atl: Data Structures in the Multicore Age.
      aug:
        au: SHAVIT, NIR
        affil: Professor of Computer Science, Tel-Aviv University.
      su:
        Data structures
        Multicore processors
        Parallel processing
        Computer architecture
        Algorithms
        Computer programmers
      sug:
        subj:
          Data structures
          Multicore processors
          Parallel processing
          Computer architecture
          Algorithms
          Computer programmers
      ab: 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.
      pubtype: Periodical
      doctype: Article
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: Y
      dt:
        @attributes:
          year: 2011
    holdings:
      @attributes:
        islocal: N