Why Concurrent Objects Are Recurrently Complicated.

A letter to the editor is presented in response to an article in the March 2011 issue entitled "Data Structures in the Multicore Age" by Nir Shavit.

Detalles Bibliográficos
Publicado en:Communications of the ACM Vol. 54; no. 6; p. 6
Autor principal: Skudlarek, Joseph P.
Formato: Letter
Publicado: Association for Computing Machinery Jun2011
Materias:
Acceso en línea:Ver este registro en EBSCOhost
fields @attributes:
  recordID: 1
pdfLink:
plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=63231714&site=ehost-live
header:
  @attributes:
    shortDbName: hlh
    uiTerm: 63231714
    longDbName: Humanities International Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        00010782
        ACM
      jtl: Communications of the ACM
      issn: 00010782
      maglogo: N
    pubinfo:
      dt: Jun2011
      vid: 54
      iid: 6
      pid: 68
      pub: Association for Computing Machinery
    artinfo:
      ui:
        63231714
        10.1145/1953122.1953124
      ppf: 6
      ppct: 0
      formats:
      tig:
        atl: Why Concurrent Objects Are Recurrently Complicated.
      aug:
        au: Skudlarek, Joseph P.
      su:
        Letters to the editor
        Data structures
        Pseudocode (Computer program language)
      sug:
        subj:
          Letters to the editor
          Data structures
          Pseudocode (Computer program language)
      ab: A letter to the editor is presented in response to an article in the March 2011 issue entitled "Data Structures in the Multicore Age" by Nir Shavit.
      pubtype: Periodical
      doctype: Letter
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: Y
      dt:
        @attributes:
          year: 2011
    holdings:
      @attributes:
        islocal: N