The information structure of distributed mutual exclusion algorithms
ACM Transactions on Computer Systems (TOCS)
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
A log (N) distributed mutual exclusion algorithm based on path reversal
Journal of Parallel and Distributed Computing
Asynchronous group mutual exclusion (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
A Fair Distributed Mutual Exclusion Algorithm
IEEE Transactions on Parallel and Distributed Systems
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
A mutual exclusion algorithm for ad hoc mobile networks
Wireless Networks
A Dynamic Information-Structure Mutual Exclusion Algorithm for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
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
A Dynamic Group Mutual Exclusion Algorithm Using Surrogate-Quorums
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Brief announcement: improved asynchronous group mutual exclusion in token-passing networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
A priority-based distributed group mutual exclusion algorithm when group access is non-uniform
Journal of Parallel and Distributed Computing
A Link-failure Resilient Token based Mutual Exclusion Algorithm for Directed Graph Topology
ISPDC '08 Proceedings of the 2008 International Symposium on Parallel and Distributed Computing
Modified raymond's algorithm for priority (MRA-P) based mutual exclusion in distributed systems
ICDCIT'06 Proceedings of the Third international conference on Distributed Computing and Internet Technology
Hi-index | 0.00 |
This paper aims towards designing a new token-based mutual exclusion algorithm for distributed systems. In some of the earlier work, token based algorithms for mutual exclusion are proposed for the distributed environment assuming inverted tree topology. In a wireless setup, such a stable, hierarchical topology is quite unrealistic due to frequent link failures. The proposed token-based algorithm works for processes with assigned priorities on any directed graph topology with or without cycles. The proposed algorithm, in spite of considering priorities of processes, ensures liveness in terms of token requests from low priority processes. Moreover, the algorithm keeps control message traffic reasonably low. The simulation results exhibit the performance of the proposed algorithm under varied contexts besides presenting a comparative performance with other recent algorithms for mutual exclusion like FAPP (Fairness Algorithm for Priority Process).