A Fair and Starvation Free Version of Lamports Fast Mutual Exclusion Algorithm

Keywords

Abstract

The first and only fair and starvation free version
of Lamport's fast mutual exclusion algorithm is
presented, that is faster than any other existing starvation
free algorithm in the contention free state. It uses eight
memory references in the absence of contention. Further,
this algorithm removes the drawbacks of Lamport's
algorithm, namely unfairness, starvation and high release
cost.