A √N algorithm for mutual exclusion in decentralized systems
- 1 May 1985
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computer Systems
- Vol. 3 (2), 145-159
- https://doi.org/10.1145/214438.214445
Abstract
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.Keywords
This publication has 5 references indexed in Scilit:
- Synchronization in Distributed ProgramsACM Transactions on Programming Languages and Systems, 1982
- An optimal algorithm for mutual exclusion in computer networksCommunications of the ACM, 1981
- Decentralized extrema-finding in circular configurations of processorsCommunications of the ACM, 1980
- A Majority consensus approach to concurrency control for multiple copy databasesACM Transactions on Database Systems, 1979
- An improved algorithm for decentralized extrema-finding in circular configurations of processesCommunications of the ACM, 1979