Design of a Dynamic Mutual Exclusion Algorithm for a Distributed Network of Autonomous Nodes (Special Section on the 5th Karuizawa Workshop on Circuits and Systems)

概要

論文の詳細を見る
This paper treats mutual exclusion of a single shared-resource in distributed autonomous environments. The most important property of the autonomous network treated in this paper is its membership variability, that is, frequent occurrence of entries of new nodes and exits of old nodes. Thus, when the network is large-scale, it is not possible for each node to keet up the information of all other nodes. We in this paper design a mutual exclusion algorithm for distributed environments of autonomous nodes based on Chandy-Misra protocol for Dining Philosopher (diners) problems,^<(1)> which realizes a distributed implementation of the token ring method.^<(6)> We consider requirements of the communication topology that makes mutual exclusion possible, and propose entry and exit protocols for each node to perform them individualistically and autonomously.
社団法人電子情報通信学会の論文
1993-03-25