How to assign votes in a distributed system
Journal of the ACM (JACM)
The vulnerability of vote assignments
ACM Transactions on Computer Systems (TOCS)
The Reliability of Voting Mechanisms
IEEE Transactions on Computers
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
A Theory of Coteries: Mutual Exclusion in Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Voting as the Optimal Static Pessimistic Scheme for Managing Replicated Data
IEEE Transactions on Parallel and Distributed Systems
Optimal coteries for rings and related networks
Distributed Computing
Minimizing the Maximum Delay for Reaching Consensus in Quorum-Based Mutual Exclusion Schemes
IEEE Transactions on Parallel and Distributed Systems
Improving the Availability of Mutual Exclusion Systems on Incomplete Networks
IEEE Transactions on Computers
A survey of permission-based distributed mutual exclusion algorithms
Computer Standards & Interfaces
| Hi-index | 0.00 |
Let C and D be two distinct coteries under the vertex set V of a graph G = (V, E) that models a distributed system. Coterie C is said to G-dominate D (with respect to G) if the following condition holds: For any connected subgraph H of G that contains a quorum in D (as a subset of its vertex set), there exists a connected subgraph H驴 of H that contains a quorum in C. A coterie C on a graph G is said to be G-nondominated (G-ND) (with respect to G) if no coterie D (驴C) on G G-dominates C. Intuitively, a G-ND coterie consists of irreducible quorums.This paper characterizes G-ND coteries in graph theoretical terms, and presents a procedure for deciding whether or not a given coterie C is G-ND with respect to a given graph G, based on this characterization. We then improve the time complexity of the decision procedure, provided that the given coterie C is nondominated in the sense of Garcia-Molina and Barbara. Finally, we characterize the class of graphs G on which the majority coterie is G-ND.