Abhishek Swaroop and Awadhesh Kumar Singh A Fault Tolerant Tokenbased Algorithm for Group Mutual Exclusion in Distributed Systems
322 - 328
2008
2
2
International Journal of Computer, Electrical, Automation, Control and Information Engineering http://waset.org/publications/2523
http://waset.org/publications/14
World Academy of Science, Engineering and Technology
The group mutual exclusion (GME) problem is a
variant of the mutual exclusion problem. In the present paper a
tokenbased group mutual exclusion algorithm, capable of handling
transient faults, is proposed. The algorithm uses the concept of
dynamic request sets. A time out mechanism is used to detect the
token loss; also, a distributed scheme is used to regenerate the token.
The worst case message complexity of the algorithm is n1. The
maximum concurrency and forum switch complexity of the
algorithm are n and min (n, m) respectively, where n is the number of
processes and m is the number of groups. The algorithm also satisfies
another desirable property called smooth admission. The scheme can
also be adapted to handle the extended group mutual exclusion
problem.
International Science Index 14, 2008