Improving fast mutual exclusion
Eugene Styer · 1992
Most mutual exclusion algorithms require O(n) operations to enter the critical section despite how many may be actively trying to enter the critical section.This paper presents a mutual exclusion algorithm that is much more sensitive to how many processes currently want to enter the critical section.This algorithm is based on a parameter 1, and assumes there is a total of n = kl processes.If only one process wants to enter the critical section, 1 + 7 operations are sufficient.If there are -t processes currently wanting to enter the critical section, then (9(tlk) operations are all that is necessary.This is ususally much less than the O(n) operations required by ordinary mutual exclusion algorithms.If the need is only to elect one process, the same minimum of 8 operations will hold, but the number of variables used will be O(log t), if t processes are contending to be elected.This algorithm will also by symmetric, with no distinctions between processes.