A new generalization of Dekker's algorithm for mutual exclusion
Information Processing Letters
Absence of individual starvation using weak semaphores
Information Processing Letters
Fairness
Concurrent programming: principles and practice
Concurrent programming: principles and practice
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Modern operating systems
Distributed Algorithms
"Sometime" is sometimes "not never": on the temporal logic of programs
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Specification and Analysis of Concurrent Systems: The COSY Approach
Specification and Analysis of Concurrent Systems: The COSY Approach
| Hi-index | 0.00 |
The paper deals with a generic solution of the Mutual Exclusion Problem using semaphores only. We use in the solution weakly fair binary semaphores and (not necessarily fair) semaphores with initial value k. All semaphores are simple in that the P and V operations on them are paired in the natural way avoiding split semaphores. No auxiliary shared variables are used. We define a general form of the mutual exclusion problem. We claim: (1) All mutual exclusion problems can be solved using only simple semaphores. (2) All mutual exclusion problems can be solved fairly (with bounded waiting) using simple semaphores (weakly fair binary and initially-k; semaphores). We give some bounds on how many semaphores are needed for standard problems. The solutions given may be inefficient: a mutual exclusion problem which can be solved in linear time and space with shared variables may require exponentially many semaphores.