N-process mutual exclusion with bounded waiting by 4. log//2N-valued shared variable

DOI10.1016/0022-0000(82)90010-1zbMath0493.68018OpenAlexW1995634807MaRDI QIDQ1168725

Michael O. Rabin

Publication date: 1982

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(82)90010-1

zbMATH Keywords

protocolasynchronous parallel processes

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items

Efficient test \& set constructions for faulty shared memory ⋮ Synthesizing efficient systems in probabilistic environments ⋮ Layered reasoning for randomized distributed algorithms ⋮ Randomized leader election ⋮ Shared-memory mutual exclusion: major research trends since 1986 ⋮ Using probabilistic Kleene algebra pKA for protocol verification

Cites Work

• Data Requirements for Implementation of N -Process Mutual Exclusion Using a Single Shared Variable
• Unnamed Item
• Unnamed Item