DocumentCode :
1946734
Title :
Mutual exclusion in arbitrary networks when process identity numbers are not distinct
Author :
Bouabdallah, Ahmed ; Naimi, Mohamed
Author_Institution :
Lab. d´´Inf., Besancon Univ., France
fYear :
1990
fDate :
21-23 Mar 1990
Firstpage :
885
Lastpage :
886
Abstract :
A study of the problem of the mutual exclusion of critical sections of several distributed processes is presented. Each process is given with a particular section of code called its critical section. The problem is to design protocol to ensure that, at a given time, no more than one process is executing its own critical section. A distributed algorithm for mutual exclusion working in arbitrary networks is proposed. This algorithm does not use the logical clock, and the identities of nodes are not necessarily distinct. Initially, each process knows only its adjacent channels and knows them by local identities. The network is organized as a logical rooted tree where the root holds the token. When a process wants to enter the critical section, it sends a request message over an outgoing channel toward the root and waits for the token. The number of messages required for every request is bounded by 2d where d is the diameter of the network
Keywords :
computer networks; distributed processing; protocols; arbitrary networks; distributed algorithm; distributed processes; mutual exclusion; process identity numbers; protocol; Clocks; Communication channels; Communication networks; Distributed algorithms; Distributed computing; Formal specifications; Graph theory; Intelligent networks; Joining processes; Protocols;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computers and Communications, 1990. Conference Proceedings., Ninth Annual International Phoenix Conference on
Conference_Location :
Scottsdale, AZ
Print_ISBN :
0-8186-2030-7
Type :
conf
DOI :
10.1109/PCCC.1990.101729
Filename :
101729
Link To Document :
بازگشت