Styer presents an algorithm to improve the performance of mutual exclusion when there are many contenders for the resource. He proves that the algorithm takes O ( t k l ) operations, where n = k ^l processes are dependent on the mutual exclusion and there are t contenders. The algorithm is symmetric, with no distinction between processes.

The paper is written in a clear, straightforward manner and provides a reasonable number of references. Because of its specialized nature, it is most appropriate for those interested in the theory of algorithms or those who must implement mutual exclusion with multiple contenders.