A Hierarchical Approach to Handle Group Mutual Exclusion Problem in Distributed Systems

Authors:
Abhishek Swaroop;Awadhesh Kumar Singh
Affiliations:
Department of Computer Science and Engineering, G.P.M. College of Engineering, Delhi, India 110036;Department of Computer Engineering, National Institute of Technology, Kurukshetra, India 136119
Venue:
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Year:
2009

Citing 2
Cited 0

Asynchronous group mutual exclusion (extended abstract)

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Distributed mutual exclusion algorithms for grid applications: A hierarchical approach

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A hierarchical algorithm to solve the group mutual exclusion problem has been proposed. We consider a hierarchical arrangement where the nodes are divided in to clusters. The algorithm uses a token-based protocol to handle inter-cluster requests and a centralized protocol for intra-cluster requests. The algorithm also uses a two-level priority scheme in order to assign relative weights to fairness and concurrency. Unlike other algorithms, the message complexity of our algorithm is proportional to the number of clusters rather than the number of nodes. Also, a new metric has been proposed to measure the level of coherence. The proposed algorithm is the first hierarchical solution to the group mutual exclusion problem.