How to assign votes in a distributed system
Journal of the ACM (JACM)
The Reliability of Voting Mechanisms
IEEE Transactions on Computers
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)
Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data
IEEE Transactions on Computers
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
Optimal coteries and voting schemes
Information Processing Letters
Nondominated k-coteries for multiple mutual exclusion
Information Processing Letters
Performance Characterization of the Tree Quorum Algorithm
IEEE Transactions on Parallel and Distributed Systems
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
Erratum to “Nondominated k-coteries for multiple mutual exclusion”
Information Processing Letters
A Geometric Approach for Constructing Coteries and k-Coteries
IEEE Transactions on Parallel and Distributed Systems
Analysis of Quorum-Based Protocols for Distributed (k + 1)-Exclusion
IEEE Transactions on Parallel and Distributed Systems
The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Parallel and Distributed Systems
A Theory of Coteries: Mutual Exclusion in Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Message Complexity of the Tree Quorum Algorithm
IEEE Transactions on Parallel and Distributed Systems
Generating and Approximating Nondominated Coteries
IEEE Transactions on Parallel and Distributed Systems
Obtaining Nondominated K-Coteries for Fault-Tolerant Distributed K-Mutual Exclusion
Proceedings of the 1994 International Conference on Parallel and Distributed Systems
Distributed k-Mutual Exclusion Problem and k-Coteries
ISA '91 Proceedings of the 2nd International Symposium on Algorithms
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
IEEE Transactions on Parallel and Distributed Systems
A survey of permission-based distributed mutual exclusion algorithms
Computer Standards & Interfaces
On the Nondomination of Cohorts Coteries
IEEE Transactions on Computers
k-Coteries for Tolerating Network 2-Partition
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.01 |
The coterie join operation proposed by Neilsen and Mizuno produces, from a k-coterie and a coterie, a new k-coterie. For the coterie join operation, this paper first shows 1) a necessary and sufficient condition to produce a nondominated k-coterie (more accurately, a nondominated k-semicoterie satisfying Nonintersection Property) and 2) a sufficient condition to produce a k-coterie with higher availability. By recursively applying the coterie join operation in such a way that the above conditions hold, we define nondominated k-coteries, called tree structured k-coteries, the availabilities of which are thus expected to be very high. This paper then proposes a new k-mutual exclusion algorithm that effectively uses a tree structured k-coterie, by extending Agrawal and El Abbadi's tree algorithm. The number of messages necessary for k processes obeying the algorithm to simultaneously enter the critical section is approximately bounded by k\log(n/k) in the best case, where n is the number of processes in the system.