A √N algorithm for mutual exclusion in decentralized systems
Mamoru Maekawa · ACM Transactions on Computer Systems · 1985
An algorithm is presented that uses only c√N messages to create mutual exclusion in a computer network, where N is the number of nodes and c a constant between 3 and 5. The algorithm is symmetric and allows fully parallel operation.