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

DOI10.1145/322290.322302zbMath0478.68028OpenAlexW2036522398MaRDI QIDQ3936180

No author found.

Publication date: 1982

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

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

zbMATH Keywords

performancealgorithmssynchronizationshared memorystorage managementcritical sectiondeadlockasynchronous parallel processes

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items (10)

On the mutual-exclusion problem -- a quest for minimal solutions ⋮ A visit to mutual exclusion in seven dates ⋮ An efficient solution to the mutual exclusion problem using weak semaphores ⋮ Computing with infinitely many processes ⋮ N-process mutual exclusion with bounded waiting by 4. log//2N-valued shared variable ⋮ Randomized two-process wait-free test-and-set ⋮ Shared-memory mutual exclusion: major research trends since 1986 ⋮ Hundreds of impossibility results for distributed computing ⋮ A closer look at fault tolerance ⋮ A technique for decomposing algorithms which use a single shared variable

This page was built for publication: Data Requirements for Implementation of N -Process Mutual Exclusion Using a Single Shared Variable