A tree-based algorithm for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
An efficient and fault-tolerant solution for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
A simple taxonomy for distributed mutual exclusion algorithms
ACM SIGOPS Operating Systems Review
Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data
IEEE Transactions on Computers
A distributed mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
A Fault-Tolerant Algorithm for Replicated Data Management
IEEE Transactions on Parallel and Distributed Systems
A log (N) distributed mutual exclusion algorithm based on path reversal
Journal of Parallel and Distributed Computing
A Geometric Approach for Constructing Coteries and k-Coteries
IEEE Transactions on Parallel and Distributed Systems
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
Solution of a problem in concurrent programming control
Communications of the ACM
A Delay-Optimal Quorum-Based Mutual Exclusion Algorithm for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A quorum-based self-stabilizing distributed mutual exclusion algorithm
Journal of Parallel and Distributed Computing
The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data
IEEE Transactions on Knowledge and Data Engineering
An Architecture for Survivable Coordination in Large Distributed Systems
IEEE Transactions on Knowledge and Data Engineering
A survey of permission-based distributed mutual exclusion algorithms
Computer Standards & Interfaces
A Quorum-Based Protocol for Searching Objects in Peer-to-Peer Networks
IEEE Transactions on Parallel and Distributed Systems
Distributed Systems: Principles and Paradigms (2nd Edition)
Distributed Systems: Principles and Paradigms (2nd Edition)
A Quorum-Based Group Mutual Exclusion Algorithm for a Distributed System with Dynamic Group Set
IEEE Transactions on Parallel and Distributed Systems
Multi-Token Distributed Mutual Exclusion Algorithm
AINA '08 Proceedings of the 22nd International Conference on Advanced Information Networking and Applications
A Token-Based Distributed Group Mutual Exclusion Algorithm with Quorums
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
In this paper, we propose a token-based fully distributed algorithm with token-asking method for Distributed Mutual Exclusion (DME) in a computer network composed of N nodes that communicate by message exchanges. The main goal is to introduce a new class of token-based DME algorithms called info-based algorithms. In some previous algorithms, the request to enter a critical section is sent to all nodes because the token-holding node is unknown, but in this info-based algorithm some nodes know the token-holding node and lead critical section entering requests to it, directly. This algorithm uses a logical structure in the form of a wraparound two-dimensional array which is imposed on the interconnecting network. Usually, a request message for entering the critical section is sent vertically down in the array, and eventually sent to the token-holding node with the assistant of an informed-node (common node between the row consisting of the token-holding node and the column consisting of the requester node). The nodes invoking the critical section can obtain the token with fewer message exchanges in comparison with many other algorithms. Typically, the number of message exchanges is 4N+1 under light demand which reduces to approximately 2 message exchanges under heavy demand. A correctness proof is provided.