A √N algorithm for mutual exclusion in decentralized systems 论文
1985ACM Transactions on Computer Systems引用 735
Distributed systems and fault toleranceParallel Computing and Optimization TechniquesAdvanced Data Storage Technologies
摘要
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.