How to assign votes in a distributed system
Journal of the ACM (JACM)
An efficient and fault-tolerant solution for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
IEEE Transactions on Computers
A Theory of Coteries: Mutual Exclusion in Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A simple group mutual l-exclusion algorithm
Information Processing Letters
Distributed k-Mutual Exclusion Problem and k-Coteries
ISA '91 Proceedings of the 2nd International Symposium on Algorithms
Quorum-Based Algorithms for Group Mutual Exclusion
IEEE Transactions on Parallel and Distributed Systems
The failure and recovery problem for replicated databases
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
(h, k)-Arbiters for h-out-of-k mutual exclusion problem
Theoretical Computer Science
A new self-stabilizing k-out-of-l exclusion algorithm on rings
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
A quorum based group k-mutual exclusion algorithm for open distributed environments
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.01 |
The (m,h,k)-resource allocation is a conflict resolution problem to control and synchronize a distributed system consisting of n nodes and m shared resources so that the following two requirements are satisfied: at any given time at most h (out of m) resources can be used by some nodes simultaneously, and each resource is used by at most k concurrent nodes. The problem is a natural generalization of several well-studied conflict resolution problems such as mutual exclusion, k-mutual exclusion, generalized mutual exclusion and group mutual exclusion. The problem can be solved by employing an ℓ-mutual exclusion algorithm, however, it is inefficient in terms of the message complexity and the maximum degree hk of concurrency may not be achieved. We thus propose a new algorithm and a new quorum system (m, h, k)-coterie used in it, and show that all requirements of the problem are guaranteed and the maximum concurrency degree is achieved as desired. We also present a natural extension of the new quorum system which resolves a more general problem with distinct bounded capacities and also achieves the maximum degree of concurrency, $\sum^{h}_{i=1}{k}_{i}$, of the problem.