DocumentCode :
2132508
Title :
A new token passing distributed mutual exclusion algorithm
Author :
Banerjee, Sujata ; Chrysanthis, Panos K.
Author_Institution :
Telecommun. Program, Pittsburgh Univ., PA, USA
fYear :
1996
fDate :
27-30 May 1996
Firstpage :
717
Lastpage :
724
Abstract :
Eliminating interference between concurrently executing activities through mutual exclusion is one of the most fundamental problems in computer systems. The problem of mutual exclusion in a distributed system is especially interesting owing to the lack of global knowledge in the presence of variable communication delays. In this paper, a new token-based distributed mutual exclusion algorithm is proposed. The algorithm incurs approximately three messages at high loads, irrespective of the number of nodes N in the system. At low loads, it requires approximately N messages. The paper also addresses failure recovery issues, such as token loss
Keywords :
client-server systems; delays; distributed algorithms; protocols; communication delays; concurrently executing activities; distributed system; failure recovery issues; token loss; token passing distributed mutual exclusion algorithm; Analytical models; Communication system control; Concurrent computing; Control systems; Delay; Interference elimination; Performance analysis; System recovery; Taxonomy; Telecommunication computing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Distributed Computing Systems, 1996., Proceedings of the 16th International Conference on
Print_ISBN :
0-8186-7399-0
Type :
conf
DOI :
10.1109/ICDCS.1996.508024
Filename :
508024
Link To Document :
بازگشت