Proving the Correctness of Nonblocking Data Structures.

The article discusses the correctness of nonblocking data structures. Topics covered include language and architecture memory models as considerations when programming nonblocking data structures, the unaligned word-sized memory accesses as a good example of a problem with nonblocking data-structure...

Descripción completa

Detalles Bibliográficos
Publicado en:Communications of the ACM Vol. 56; no. 7; pp. 62 - 70
Autor principal: DESNOYERS, MATHIEU
Formato: Artículo
Publicado: Association for Computing Machinery Jul2013
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=90078937&site=ehost-live
header:
  @attributes:
    shortDbName: hlh
    uiTerm: 90078937
    longDbName: Humanities International Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        00010782
        ACM
      jtl: Communications of the ACM
      issn: 00010782
      maglogo: N
    pubinfo:
      dt: Jul2013
      vid: 56
      iid: 7
      pid: 68
      pub: Association for Computing Machinery
    artinfo:
      ui:
        90078937
        10.1145/2483852.2483868
      ppf: 62
      ppct: 8
      formats:
      tig:
        atl: Proving the Correctness of Nonblocking Data Structures.
      aug:
        au: DESNOYERS, MATHIEU
        affil: President & Founder, EfficiOS
      su:
        Data structures
        Electronic data processing
        Computer programming
        Electronic file management
        Scalability
        Systems design
      sug:
        subj:
          Data structures
          Electronic data processing
          Computer programming
          Electronic file management
          Scalability
          Systems design
      ab: The article discusses the correctness of nonblocking data structures. Topics covered include language and architecture memory models as considerations when programming nonblocking data structures, the unaligned word-sized memory accesses as a good example of a problem with nonblocking data-structure programming, and how reordering can be conducted at various levels for performance reasons. Also mentioned are the considerations of throughput and scalability tied to atomic accesses and memory barriers, the use of counterexamples to illustrate problems in nonblocking data-structure design and implementation, and execution-based model checking.
      pubtype: Periodical
      doctype: Article
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: Y
      dt:
        @attributes:
          year: 2013
    holdings:
      @attributes:
        islocal: N