Concurrent reading and writing

DOI10.1145/359863.359878MaRDI QIDQ4134994zbMATH OpenOpenAlexFDO

Authors Leslie Lamport

Publication date 1977

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/359863.359878

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Formal languages and automata (68Q45)

Cited in

(10)

• On interprocess communication. II: Algorithms
• On formulating simultaneity for studying parallelism and synchronization
• The synchronization of independent processes
• Anonymous obstruction-free (n,k)-set agreement with n-k+1 atomic read/write registers
• A visit to mutual exclusion in seven dates
• Composite registers
• Efficient distributed algorithms by using the archimedean time assumption
• Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
• Concurrent search and insertion in 2-3 trees
• Wait-free computing

This page was built for publication: Concurrent reading and writing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4134994)