Affiliation:
1. Univ. of Queensland, St. Lucia, Australia
Abstract
We present an algorithm for distributed mutual exclusion in a computer network of
N
nodes that communicate by messages rather than shared memory. The algorithm uses a spanning tree of the computer network, and the number of messages exchanged per critical section depends on the topology of this tree. However, typically the number of messages exchanged is
O
(log
N
) under light demand, and reduces to approximately four messages under saturated demand.
Each node holds information only about its immediate neighbors in the spanning tree rather than information about all nodes, and failed nodes can recover necessary information from their neighbors. The algorithm does not require sequence numbers as it operates correctly despite message overtaking.
Publisher
Association for Computing Machinery (ACM)
Cited by
227 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献