Abstract
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 Dijkstra's conjecture.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
