The Computer Science of Concurrency: The Early Years.

The article presents a speech by computer scientist Leslie Lamport, a computer scientist and the 2013 recipient of the Association for Computing Machinery's (ACM's) A.M. Turing Award, entitled "The Computer Science of Concurrency: The Early Years". It discusses the history of concurrent algorithms i...

Descripción completa

Detalles Bibliográficos
Publicado en:Communications of the ACM Vol. 58; no. 6; pp. 71 - 77
Autor principal: LAMPORT, LESLIE
Formato: Speech
Publicado: Association for Computing Machinery Jun2015
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=102962471&site=ehost-live
header:
  @attributes:
    shortDbName: hlh
    uiTerm: 102962471
    longDbName: Humanities International Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        00010782
        ACM
      jtl: Communications of the ACM
      issn: 00010782
      maglogo: N
    pubinfo:
      dt: Jun2015
      vid: 58
      iid: 6
      pid: 68
      pub: Association for Computing Machinery
    artinfo:
      ui:
        102962471
        10.1145/2771951
      ppf: 71
      ppct: 6
      formats:
      tig:
        atl: The Computer Science of Concurrency: The Early Years.
      aug:
        au: LAMPORT, LESLIE
      su:
        Computer multitasking
        Algorithms
        Distributed computing
        Lamport, Leslie
        ACM A.M. Turing Award
        Twentieth century
        History
      sug:
        subj:
          Computer multitasking
          Algorithms
          Distributed computing
          Lamport, Leslie
          ACM A.M. Turing Award
          Twentieth century
          History
      ab: The article presents a speech by computer scientist Leslie Lamport, a computer scientist and the 2013 recipient of the Association for Computing Machinery's (ACM's) A.M. Turing Award, entitled "The Computer Science of Concurrency: The Early Years". It discusses the history of concurrent algorithms in the 1960s and 1970s. Topics discussed include mutual exclusion, producer-consumer synchronization, and distributed algorithms.
      pubtype: Periodical
      doctype: Speech
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: Y
      dt:
        @attributes:
          year: 2015
    holdings:
      @attributes:
        islocal: N