Title :
A new token based distributed mutual exclusion algorithm
Author :
Makki, Kia ; Pissinou, Niki ; Yesha, Yelena
Author_Institution :
Dept. of Comput. Sci., Nevada Univ., Las Vegas, NV, USA
fDate :
10/6/1993 12:00:00 AM
Abstract :
The authors present a new token based distributed mutual exclusion algorithm for a distributed computer system of N sites. The proposed algorithm is based on timestamps and the theory of finite projective planes. It also makes use of a “Token Queue” which is part of the token and contains a list of all sites which are requesting the token. The algorithm is deadlock free, free from starvation, and requires no message exchange in the best case, and 4√N - 2 message exchanges in the worst case per critical section execution
Keywords :
concurrency control; distributed algorithms; deadlock free; distributed computer system; distributed mutual exclusion; finite projective planes; timestamps; token based; Algorithm design and analysis; Clocks; Computer science; Delay effects; Distributed computing; Permission; Resource management; System recovery;
Conference_Titel :
Advances in Parallel and Distributed Systems, 1993., Proceedings of the IEEE Workshop on
Conference_Location :
Princeton, NJ
Print_ISBN :
0-8186-5250-0
DOI :
10.1109/APADS.1993.588931
