How to assign votes in a distributed system
Journal of the ACM (JACM)
The Reliability of Voting Mechanisms
IEEE Transactions on Computers
An efficient and fault-tolerant solution for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
A simple taxonomy for distributed mutual exclusion algorithms
ACM SIGOPS Operating Systems Review
Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data
IEEE Transactions on Computers
A distributed k-mutual exclusion algorithm using k-coterie
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)
k-Arbiter: a safe and general scheme for h-out of-k mutual exclusion
Theoretical Computer Science
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
IEEE Transactions on Parallel and Distributed Systems
Quorum-Based Algorithms for Group Mutual Exclusion
IEEE Transactions on Parallel and Distributed Systems
Asynchronous group mutual exclusion
Distributed Computing
A priority-based distributed group mutual exclusion algorithm when group access is non-uniform
Journal of Parallel and Distributed Computing
A Quorum-Based Group Mutual Exclusion Algorithm for a Distributed System with Dynamic Group Set
IEEE Transactions on Parallel and Distributed Systems
A Token-Based Distributed Group Mutual Exclusion Algorithm with Quorums
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
The resource allocation problem is one of the fundamental problems for conflict resolution in distributed systems. In this paper, we consider the (n, m, k, d) -resource allocation problem, proposed by Joung [Joung, Distributed Computing (2010)], which is a generalization of the k-mutual exclusion problem and the group mutual exclusion problem. We propose a fully distributed solution based on tokens for the (n, m, k, d)-resource allocation problem for asynchronous message passing distributed systems. Previous works allow a process to request only one resource at a time. In our algorithm, the amount of resources that a process may request is arbitrary. The algorithm is designed based on leader-follower scheme, and permission to access resources is granted by tokens. The first process that requests resources becomes the leader, and then, other processes become followers and they are granted their requests by the leader. The message complexity of the proposed algorithm is bounded by (O(|Q|) in the worst case and O(1) in the best case, where |Q| is the size of quorums of a coterie that the algorithm uses.