Mutual exclusion revisited
Boleslaw Karol Szymanski · 2002
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.>