Deconstructing the Bakery to Build a Distributed State Machine.
The article discusses two computer algorithms created by the author: the bakery algorithm which is based on mutual exclusion and the distributed state-machine algorithm which aims to achieve fault tolerance in a network of computers. Mathematical proofs are provided.
| Publicado en: | Communications of the ACM Vol. 65; no. 9; pp. 58 - 67 |
|---|---|
| Autor principal: | |
| Formato: | Artículo |
| Publicado: |
Association for Computing Machinery
Sep2022
|
| 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=158687859&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 158687859 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00010782 ACM jtl: Communications of the ACM issn: 00010782 maglogo: N pubinfo: dt: Sep2022 vid: 65 iid: 9 pid: 68 pub: Association for Computing Machinery artinfo: ui: 158687859 10.1145/3513259 ppf: 58 ppct: 9 formats: tig: atl: Deconstructing the Bakery to Build a Distributed State Machine. aug: au: LAMPORT, LESLIE affil: The recipient of the 2013 ACM A.M. Turing Award su: Algorithms Mathematical proofs sug: subj: Algorithms Mathematical proofs ab: The article discusses two computer algorithms created by the author: the bakery algorithm which is based on mutual exclusion and the distributed state-machine algorithm which aims to achieve fault tolerance in a network of computers. Mathematical proofs are provided. pubtype: Periodical doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y dt: @attributes: year: 2022 holdings: @attributes: islocal: N |
|---|