## Mutual Exclusion Revisited

by
Boleslaw K. Szymanski

Citations: | 7 - 1 self |

### BibTeX

@MISC{Szymanski_mutualexclusion,

author = {Boleslaw K. Szymanski},

title = {Mutual Exclusion Revisited},

year = {}

}

### OpenURL

### 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 the Morris's solution of the mutual exclusion with three weak semaphores. The presented algorithms compare favorably with equivalent published mutual exclusion algorithms in their program's size and the number of required communication bits.