A first-come-first-served mutual-exclusion algorithm with small communication variables
Ed Lycklama, Vassos Hadzilacos · ACM Transactions on Programming Languages and Systems · 1991
We present an algorithm for the mutual-exclusion problem that satisfies the "first-come-firstserved" property and requires only five shared bits per participant.The algorithm works in a model of concurrency that does not assume atomic operations.