A distributed algorithm for multiple entries to a critical section
Information Processing Letters
Another distributed algorithm for multiple entries to a critical section
Information Processing Letters
A distributed k-mutual exclusion algorithm using k-coterie
Information Processing Letters
A token based k-resilient mutual exclusion algorithm for distributed systems
Information Processing Letters
Nondominated k-coteries for multiple mutual exclusion
Information Processing Letters
A distributed mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
Analysis of Quorum-Based Protocols for Distributed (k + 1)-Exclusion
IEEE Transactions on Parallel and Distributed Systems
k-Arbiter: a safe and general scheme for h-out of-k mutual exclusion
Theoretical Computer Science
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
An optimal algorithm for mutual exclusion in computer networks
Communications of the ACM
IEEE Transactions on Computers
A simple group mutual l-exclusion algorithm
Information Processing Letters
Obtaining Nondominated K-Coteries for Fault-Tolerant Distributed K-Mutual Exclusion
Proceedings of the 1994 International Conference on Parallel and Distributed Systems
Quorum-Based Algorithms for Group Mutual Exclusion
IEEE Transactions on Parallel and Distributed Systems
A Comparison of Two Torus-Based K-Coteries
ICPADS '98 Proceedings of the 1998 International Conference on Parallel and Distributed Systems
A distributed K-mutual exclusion algorithm
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
k-Coteries for Tolerating Network 2-Partition
IEEE Transactions on Parallel and Distributed Systems
A Quorum-Based Group Mutual Exclusion Algorithm for a Distributed System with Dynamic Group Set
IEEE Transactions on Parallel and Distributed Systems
A distributed mutual exclusion algorithm over multi-routing protocol for mobile ad hoc networks
International Journal of Parallel, Emergent and Distributed Systems
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
| Hi-index | 0.24 |
The distributed k-mutual exclusion problem or, simply the k-mutex problem, is the problem of allowing at most k processes to access their critical sections simultaneously. This might be the consequence where k identical copies of a resource are made available in the distributed system or that the resource by its nature can be accessed by at most k processes simultaneously. When a process enters it critical section such that there are l