Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Mamoru Maekawa (1985) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: