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 N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
Load Balancing in Quorum Systems
SIAM Journal on Discrete Mathematics
IEEE Transactions on Parallel and Distributed Systems
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
Generating and Approximating Nondominated Coteries
IEEE Transactions on Parallel and Distributed Systems
Nondominated Coteries on Graphs
IEEE Transactions on Parallel and Distributed Systems
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Optimal coteries for rings and related networks
Distributed Computing
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 14.98 |
We model a distributed system by a graph $G=(V,E)$, where $V$ represents the set of processes and $E$ the set of bidirectional communication links between two processes. $G$ may not be complete. A popular (distributed) mutual exclusion algorithm on $G$ uses a coterie ${\cal C} (\subseteq 2^V)$, which is a nonempty set of nonempty subsets of $V$ (called quorums) such that, for any two quorums $P, Q \in {\cal C}$, 1) $P \cap Q \ne \emptyset$ and 2) $P \not\subset Q$ hold. The availability is the probability that the algorithm tolerates process and/or link failures, given the probabilities that a process and a link, respectively, are operational. The availability depends on the coterie used in the algorithm. This paper proposes a method to improve the availability by transforming a given coterie.