A new solution to the critical section problem

DOI10.1145/800133.804335MaRDI QIDQ5402544zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A new solution of Dijkstra's concurrent programming problem
• The mutual exclusion problem. I: A theory of interprocess communication
• The mutual exclusion problem
• On the family of critical section problems
• The mutual exclusion problem: part II---Statement and solutions

Cited in

(12)

• Bounded time-stamps
• An asynchronous message-passing distributed algorithm for the generalized local critical section problem
• A fault-tolerant file management algorithm in distributed computer system ``THUDS
• scientific article; zbMATH DE number 3848597 (Why is no real title available?)
• The critical inclination problem ? 30 years of progress
• How to solve the Santa Claus problem
• scientific article; zbMATH DE number 2049014 (Why is no real title available?)
• On the family of critical section problems
• A new solution of Dijkstra's concurrent programming problem
• A method for solving synchronization problems
• Nonatomic dual bakery algorithm with bounded tokens
• Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5402544)