Design of a Dynamic Mutual Exclusion Algorithm for a Distributed Network of Autonomous Nodes

Kenji ONAGA; Morikazu NAKAMURA; Seiki KYAN

Design of a Dynamic Mutual Exclusion Algorithm for a Distributed Network of Autonomous Nodes

Kenji ONAGA, Morikazu NAKAMURA, Seiki KYAN

Full Text Views

0

Share
Cite this

Summary :

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, which realizes a distributed implementation of the token ring method. 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.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E76-A No.3 pp.387-398

Publication Date: 1993/03/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on the 5th Karuizawa Workshop on Circuits and Systems)

Category

Cite this

Copy

Kenji ONAGA, Morikazu NAKAMURA, Seiki KYAN, "Design of a Dynamic Mutual Exclusion Algorithm for a Distributed Network of Autonomous Nodes" in IEICE TRANSACTIONS on Fundamentals, vol. E76-A, no. 3, pp. 387-398, March 1993, doi: .
Abstract: 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, which realizes a distributed implementation of the token ring method. 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.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/e76-a_3_387/_p

Copy

@ARTICLE{e76-a_3_387,
author={Kenji ONAGA, Morikazu NAKAMURA, Seiki KYAN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Design of a Dynamic Mutual Exclusion Algorithm for a Distributed Network of Autonomous Nodes},
year={1993},
volume={E76-A},
number={3},
pages={387-398},
abstract={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, which realizes a distributed implementation of the token ring method. 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.},
keywords={},
doi={},
ISSN={},
month={March},}

Copy

TY - JOUR
TI - Design of a Dynamic Mutual Exclusion Algorithm for a Distributed Network of Autonomous Nodes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 387
EP - 398
AU - Kenji ONAGA
AU - Morikazu NAKAMURA
AU - Seiki KYAN
PY - 1993
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E76-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 1993
AB - 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, which realizes a distributed implementation of the token ring method. 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.
ER -