A technique for decomposing algorithms which use a single shared variable

DOI10.1016/0022-0000(83)90047-8zbMath0549.68014OpenAlexW1984593614MaRDI QIDQ800081

Nancy A. Lynch, Michael J. Fischer

Publication date: 1983

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(83)90047-8

zbMATH Keywords

synchronization algorithmsasynchronous processescontending processes

Mathematics Subject Classification ID

Theory of operating systems (68N25) Algorithms in computer science (68W99)

Cites Work

• Upper bounds for static resource allocation in a distributed system
• Data Requirements for Implementation of N -Process Mutual Exclusion Using a Single Shared Variable
• Unnamed Item
• Unnamed Item

This page was built for publication: A technique for decomposing algorithms which use a single shared variable