The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
A distributed algorithm for mutual exclusion in an arbitrary network
The Computer Journal
A distributed algorithm for multiple entries to a critical section
Information Processing Letters
A tight amortized bound for path reversal
Information Processing Letters
A simple taxonomy for distributed mutual exclusion algorithms
ACM SIGOPS Operating Systems Review
Another distributed algorithm for multiple entries to a critical section
Information Processing Letters
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
A Distributed Solution to the k-out of-M Resources Allocation Problem
ICCI '91 Proceedings of the International Conference on Computing and Information: Advances in Computing and Information
Distributed mutual exclusion on hypercubes
ACM SIGOPS Operating Systems Review
Limitations of using tokens for mutual exclusion
CSC '95 Proceedings of the 1995 ACM 23rd annual conference on Computer science
A distributed token-based algorithm for the dynamic resource allocation problem
ACM SIGOPS Operating Systems Review
(h, k)-Arbiters for h-out-of-k mutual exclusion problem
Theoretical Computer Science
| Hi-index | 0.00 |
This paper proposes a token based mutual exclusion algorithm for distributed systems that allows K simultaneous entries to a critical section. In the algorithm, a logical directed graph is maintained in a connected network.This algorithm does not use sequence numbers, and the number of messages required to provide mutual exclusion, is between 0 and 2*(N-l) where N is the number of processes in the network.