By Topic

A new token based distributed mutual exclusion algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Kia Makki ; Dept. of Comput. Sci., Nevada Univ., Las Vegas, NV, USA ; Pissinou, N. ; Yesha, Y.

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

Published in:

Advances in Parallel and Distributed Systems, 1993., Proceedings of the IEEE Workshop on

Date of Conference:

6 Oct 1993