How to assign votes in a distributed system
Journal of the ACM (JACM)
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
Distributed algorithm for K-entries to critical section based on the directed graphs
ACM SIGOPS Operating Systems Review
A taxonomy of distributed mutual exclusion
Journal of Parallel and Distributed Computing
A distributed k-mutual exclusion algorithm using k-coterie
Information Processing Letters
Distributed algorithms for multiple entries to a critical section with priority
Information Processing Letters
Nondominated k-coteries for multiple mutual exclusion
Information Processing Letters
Comments on "Availability of k-Coterie"
IEEE Transactions on Computers
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
A simple scheme to construct k-coteries with ON uniform quorum sizes
Information Processing Letters
Cohorts Structures for Fault-Tolerant k Entries to a Critical Section
IEEE Transactions on Computers
A Geometric Approach for Constructing Coteries and k-Coteries
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)
Fail-stop processors: an approach to designing fault-tolerant computing 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 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
Analysis of Quorum-Based Protocols for Distributed (k+1)-Exclusion
COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
A distributed K-mutual exclusion algorithm
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
A distributed token based h-out of-k Mutual Exclusion protocol for mobile ad hoc networks
International Journal of Ad Hoc and Ubiquitous Computing
Quorum based distributed conflict resolution algorithm for bounded capacity resources
ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
Hi-index | 5.23 |
h-Out-of-k mutual exclusion is a generalization of the 1-mutual exclusion problem, where there are k units of shared resources and each process requests h (1 ≤ h ≤ k) units at the same time. Though k-arbiter has been shown to be a quorum-based solution to this problem, quorums in k-arbiter are much larger than those in the 1-coterie for 1-mutual exclusion. Thus, the algorithm based on k-arbiter needs many messages. This paper introduces the new notion that each request uses different quorums depending on the number of units of its request. Based on the notion, this paper defines two (h,k)-arbiters for h-out-of-k mutual exclusion: a uniform (h,k)-arbiter and a (k + 1)-cube (h,k)-arbiter. The quorums in each (h,k)-arbiter are not larger than the ones in the corresponding k-arbiter; consequently, it is more efficient to use (h,k)-arbiters than the k-arbiters. A uniform (h,k)-arbiter is a generalization of the majority coterie for 1-mutual exclusion. A (k + 1)-cube (h,k)-arbiter is a generalization of square grid coterie for 1-mutual exclusion.