A tree-based algorithm for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
A Heuristically-Aided Algorithm for Mutual Exclusion in Distributed Systems
IEEE Transactions on Computers
Two algorithms for mutual exclusion in real-time distributed computer systems
Journal of Parallel and Distributed Computing
A log (N) distributed mutual exclusion algorithm based on path reversal
Journal of Parallel and Distributed Computing
An optimal algorithm for mutual exclusion in computer networks
Communications of the ACM
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Applying a Path-Compression technique to Obtain an Efficient Distributed Mutual Exclusion Algorithm
Proceedings of the 3rd International Workshop on Distributed Algorithms
Distributed Mutual Exclusion Token-Permission Based by Prioritized Groups
AICCSA '01 Proceedings of the ACS/IEEE International Conference on Computer Systems and Applications
Prioritized Token-Based Mutual Exclusion for Distributed Systems
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
A New Link Failure Resilient Priority Based Fair Mutual Exclusion Algorithm for Distributed Systems
Journal of Network and Systems Management
| Hi-index | 0.00 |
The traditional approaches towards implementing mutual exclusion can not be applied for distributed systems where nodes are loosely coupled. The existing algorithms typically follow either a symmetric or a token based approach. While the symmetric algorithms tend to increase the network traffic, token based approach offers solutions at a lower communication cost. Raymond has designed an efficient token based mutual exclusion algorithm. However, one major limitation of Raymond's algorithm is the lack of fairness in the sense that a token request that is generated later may be granted ahead of another request that was made earlier. In this work, we have proposed a modification of Raymond's algorithm. The new token based algorithm not only overcomes the fairness problem, but also handles the priority of the requesting processes.