The algorithm for the mutual-exclusion problem discussed in this paper satisfies the first-come-first-served property. Five shared bits per process are required to implement the algorithm. The authors claim that this algorithm is the first of its kind to use a constant number of bits to achieve these properties; other such algorithms require O(N) shared bits per process. The paper is well written and easy to follow. The proofs are straightforward. Not only is the algorithm discussed, but additional information relating this research to other such algorithms is outlined. A reader only vaguely familiar with the concept of mutual exclusion as it relates to critical sections of code will be able to follow the concepts and proofs.