Token Based Group Mutual Exclusion for Asynchronous Rings (Extended Abstract)
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
A New Link Failure Resilient Priority Based Fair Mutual Exclusion Algorithm for Distributed Systems
Journal of Network and Systems Management
| Hi-index | 0.00 |
Group mutual exclusion (GME) was first introduced by Joung in 1998 as a generalization of the n-process mutual exclusion problem, and subsequently modeled as the Congenial Talking Philosophers problem. GME allows processes requesting for the same resource to concurrently access the shared resource. However, a process requesting a resource that is different from the one currently being used will not be able to access the requested resource at the same time. At any time, only one resource may be in use.There have been two solutions to the GME problem for a ring network. The first solution proposed by Wu and Joung [2] had an unbounded message size problem, while the second solution proposed by Cantarell et. al. [1] attempted to provide an upper-bound for the message size. However, in doing so, the second solution generated an unbounded number of messages. Hence, in this work we present a GME algorithm for a token-passing network that solves both of the problems found in the two previous solutions by providing an upper bound both to the number of messages and to message size.