Comments on Morris's starvation-free solution to the mutual exclusion problem (Q1081301)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Comments on Morris's starvation-free solution to the mutual exclusion problem |
scientific article |
Statements
Comments on Morris's starvation-free solution to the mutual exclusion problem (English)
0 references
1986
0 references
Morris's (1979) starvation-free solution to the mutual exclusion problem for an unknown number of processors, using three 'weak' binary semaphores, is modified to an algorithm for a known number of processors, using two 'weaker' binary semaphores. The correctness of the new algorithm is more or less formally proven. It is shown that Morris's algorithm does not refute Dijktra's conjecture.
0 references
critical section
0 references
starvation
0 references
processors
0 references
semaphores
0 references
correctness
0 references
