The information structure of distributed mutual exclusion algorithms
ACM Transactions on Computer Systems (TOCS)
A taxonomy of distributed mutual exclusion
Journal of Parallel and Distributed Computing
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)
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
On Distributed Dynamic Channel Allocation in Mobile Cellular Networks
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.01 |
The revoke mechanism in generalized relaxed distributed mutual exclusion algorithm GRME [1] for eliminating a potential deadlock can cause extensive unnecessary revoke actions by the nodes which fail to receive the required granted-replies to their resource requests within a certain predefined time limit. It may happen that there is actually no deadlock present or that only a few nodes need to revoke some of their resource requests to eliminate the deadlock. We show that if the interference graph G is triangle-free (no three nodes are mutually adjacent), then we can choose the request-sets Ri in GRME in such a way that deadlocks are prevented altogether and there is no need to use revoke-messages, while keeping the resource-use decisions fully distributed and allowing non-interfering nodes to use the resource simultaneously.