Algorithms for mutual exclusion
Algorithms for mutual exclusion
The information structure of distributed mutual exclusion algorithms
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
Distributed mutual exclusion algorithms in mobile ad hoc networks: an overview
ACM SIGOPS Operating Systems Review
| Hi-index | 0.00 |
In this paper, we present an extension of the fault-tolerant mutual exclusion algorithm of [1] to make it deadlock-free when a node requesting critical section or when a node executing its critical section fails. The proposed algorithm requires O(√tn) messages per critical section entry (in a network of n nodes) and O(t√tn) messages when a node fails (t − 1 is the upper bound of the node failures).