Concurrent reading and writing

DOI10.1145/359863.359878zbMath0361.68091OpenAlexW2121236443MaRDI QIDQ4134994

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

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

Related Items (10)

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

This page was built for publication: Concurrent reading and writing