A token-based solution to the group mutual l-exclusion problem in message passing distributed systems

Authors:
Abhishek Swaroop;Awadhesh Kumar Singh
Affiliations:
Department of Computer Sc. and Engineering, G.P.M. College of Engineering, Delhi, India;Department of Computer Engineering, National Institute of Technology, Haryana, India
Venue:
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Year:
2010

Citing 2
Cited 0

Asynchronous group mutual exclusion (extended abstract)

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
A simple group mutual l-exclusion algorithm

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Group Mutual l-Exclusion (GMLE) problem is an interesting combination of two widely studied generalizations of the classical mutual exclusion problem namely, k-exclusion and group mutual exclusion (GME). In GMLE, up to l sessions can be held simultaneously. In the present exposition, we propose a token-based algorithm to the GMLE problem. To the best of our knowledge, this is the first token-based algorithm for the GMLE problem. The proposed algorithm satisfies all properties necessary for a GMLE algorithm.