A TREE-BASED ALGORITHM FOR DISTRIBUTED MUTUAL EXCLUSION
A TREE-BASED ALGORITHM FOR DISTRIBUTED MUTUAL EXCLUSION
复制标题
DOI：
10.1145/58564.59295
复制
发表时间：
1989-02-01
影响因子：
1.5
通讯作者：
RAYMOND, K
中科院分区：
文献类型：
--
作者：
RAYMOND, K
我们提出了一个算法的分布式互斥的计算机网络中的N个节点，通信的消息，而不是共享内存。该算法使用计算机网络的生成树，并且每个关键部分交换的消息的数量取决于该树的拓扑。然而，通常情况下，交换的消息的数量是O（logN）在轻的需求，并减少到约4个消息在饱和的需求。每个节点只持有关于它的直接邻居在生成树中的信息，而不是关于所有节点的信息，和失败的节点可以从他们的邻居恢复必要的信息。该算法不需要序列号，因为它可以正确运行，尽管消息超越。
We present an algorithm for distributed mutual exclusion in a computer network ofNnodes 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 isO(logN) 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.