Title :
Mutual exclusion revisited
Author :
Szymanski, Boleslaw K.
Author_Institution :
Dept. of Comput. Sci., Rensselaer Polytech. Inst., Troy, NY, USA
Abstract :
A family of four mutual exclusion algorithms is presented. Its members vary from a simple three-bit linear wait mutual exclusion to the four-bit first-come first-served algorithm immune to various faults. The algorithms are based on a scheme similar to J.M. Morris´s (1979) solution of the mutual exclusion problem with three weak semaphores. The present algorithms compare favorably with equivalent published mutual exclusion algorithms in their program´s size and the number of required communication bits
Keywords :
concurrency control; operating systems (computers); concurrency control; four-bit first-come first-served algorithm; mutual exclusion algorithms; Clocks; Computer science; Contracts; Control systems; Degradation; Delay; Distributed processing; Robustness; Testing; Very large scale integration;
Conference_Titel :
Information Technology, 1990. 'Next Decade in Information Technology', Proceedings of the 5th Jerusalem Conference on (Cat. No.90TH0326-9)
Conference_Location :
Jerusalem
Print_ISBN :
0-8186-2078-1
DOI :
10.1109/JCIT.1990.128275
