A new solution of Dijkstra's concurrent programming problem
Communications of the ACM
Further comments on Dijkstra's concurrent programming control problem
Communications of the ACM
Additional comments on a problem in concurrent programming control
Communications of the ACM
Solution of a problem in concurrent programming control
Communications of the ACM
Economical solutions for the critical section problem in a distributed system (Extended Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
The mutual exclusion problem: partII—statement and solutions
Journal of the ACM (JACM)
A simple solution to Lamport's concurrent programming problem with linear wait
ICS '88 Proceedings of the 2nd international conference on Supercomputing
Bounded concurrrent time-stamp systems are constructible
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Atomic snapshots of shared memory
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
A first-come-first-served mutual-exclusion algorithm with small communication variables
ACM Transactions on Programming Languages and Systems (TOPLAS)
Atomic snapshots of shared memory
Journal of the ACM (JACM)
A bounded first-in, first-enabled solution to the l-exclusion problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
New Real-Time Simulations of Multihead Tape Units
Journal of the ACM (JACM)
Decentralized Simulation of Resource Managers
Journal of the ACM (JACM)
Concurrent Reading While Writing
ACM Transactions on Programming Languages and Systems (TOPLAS)
A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed Computing
A distributed synchronization mechanism for interacting processes
Computer Languages
Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
A classical problem in concurrent program control is to provide a mechanism whereby several processes running concurrently can gain exclusive control of a resource. For each process, the section of its program in which it accesses the resource is called its critical section, and the problem is called the critical section problem. A solution to the critical section problem guarantees that no more than one process can be in its critical section at any time. The solution presented here improves on previous solutions by allowing processes to enter their critical sections on a first-come first-served basis.