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
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
A distributed k-mutual exclusion algorithm using k-coterie
Information Processing Letters
Nondominated k-coteries for multiple mutual exclusion
Information Processing Letters
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
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
Recognizing Nondominated Coteries and wr-Coteries by Availability
IEEE Transactions on Parallel and Distributed Systems
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
Coterie Join Operation and Tree Structured k-Coteries
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A Theory of Coteries: Mutual Exclusion in Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
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
Obtaining Nondominated K-Coteries for Fault-Tolerant Distributed K-Mutual Exclusion
Proceedings of the 1994 International Conference on Parallel and Distributed Systems
A survey of permission-based distributed mutual exclusion algorithms
Computer Standards & Interfaces
A distributed token based h-out of-k Mutual Exclusion protocol for mobile ad hoc networks
International Journal of Ad Hoc and Ubiquitous Computing
| Hi-index | 0.00 |
The k-Arbiter is a useful concept to solve the distributed h-out-of-k mutual exclusion problem. The distributed h-out-of-k mutual exclusion algorithms, based on the k-arbiter, have the benefits of high fault tolerance and low message cost. However, according to the definition of the k-arbiter, it is required to have a nonempty intersection among any (k+1) quorums in a k-arbiter. Consequently, constructing k-arbiters is difficult. The coterie join operation proposed by Neilsen and Mizuno produces a new and larger coterie by joining known coteries. In this paper, by extending the coterie join operation, we first propose a k-arbiter join operation to construct a new and larger k-arbiter from known k-arbiters for a large system. Then, we derive a necessary and sufficient condition for the k-arbiter join operation to construct a nondominated joined k-arbiter. Moreover, we discuss availability properties of the joined k-arbiters. We observe that, by selecting proper k-arbiters, the joined k-arbiter can provide a higher availability than that of the original input. Finally, we propose a k-arbiter compound operation to construct k-arbiters by using coteries and/or k-coteries. By that way, the problem of constructing k-arbiters can be reduced to the problem of constructing coteries and/or k-coteries.