A distributed K-mutual exclusion algorithm

Authors:
S. Bulgannawar;N. H. Vaidya
Affiliations:
-;-
Venue:
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
Year:
1995

Citing 0
Cited 9

An efficient distributed method for allocating resources based on an unobstructed squeezing technique

ACM SIGOPS Operating Systems Review
The congenial talking philosophers problem in computer networks

Distributed Computing
Predicate Control for Active Debugging of Distributed Programs

IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
(h, k)-Arbiters for h-out-of-k mutual exclusion problem

Theoretical Computer Science
Predicate control: synchronization in distributed computations with look-ahead

Journal of Parallel and Distributed Computing
An algorithm for k-mutual exclusion in decentralized systems

Computer Communications
A Group k-Mutual Exclusion Algorithm for Mobile Ad Hoc Networks

IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part II: Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living
Exploiting opportunistic overhearing to improve performance of mutual exclusion in wireless ad hoc networks

WWIC'12 Proceedings of the 10th international conference on Wired/Wireless Internet Communication
Oblivious assignment with m slots

SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

Abstract: This paper presents a token-based K-mutual exclusion algorithm. The algorithm uses K tokens and a dynamic forest structure for each token. This structure is used to forward token requests. The algorithm is expected to minimize the number of messages and also the delay in entering the critical section, at low as well as high loads. The paper presents simulation results for the proposed algorithm and compares them with three other algorithms. Unlike previous work, our simulation model assumes that a finite (non-zero) overhead is encountered when a message is sent or received. The simulation results show that, as compared to other algorithms, the proposed algorithm achieves lower delay in entering critical section as well as lower number of messages, without a significant increase in the size of the messages.