A new solution to the critical section problem

DOI10.1145/800133.804335zbMath1282.68173OpenAlexW1987182690MaRDI QIDQ5402544

Howard P. Katseff

Publication date: 14 March 2014

Published in: Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms ⋮ Bounded time-stamps ⋮ Nonatomic dual bakery algorithm with bounded tokens

This page was built for publication: A new solution to the critical section problem