How to assign votes in a distributed system
Journal of the ACM (JACM)
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Mutual exclusion in distributed systems (databases, voting, partitions)
Mutual exclusion in distributed systems (databases, voting, partitions)
Social choice theory and distributed decision making
COCS '88 Proceedings of the ACM SIGOIS and IEEECS TC-OA 1988 conference on Office information systems
Dynamic voting algorithms for maintaining the consistency of a replicated database
ACM Transactions on Database Systems (TODS)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Coding-Based Replication Schemes for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Delay-Optimal Quorum Consensus for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
The load and availability of Byzantine quorum systems
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Efficient generation of all regular non-dominated coteries
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
The costs and limits of availability for replicated services
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Information and Computation
Minimal replication cost for availability
Proceedings of the twenty-first annual symposium on Principles of distributed computing
A Hybrid Replica Control Algorithm Combining Static and Dynamic Voting
IEEE Transactions on Knowledge and Data Engineering
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
Self-Duality of Bounded Monotone Boolean Functions and Related Problems
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
A survey of permission-based distributed mutual exclusion algorithms
Computer Standards & Interfaces
k-Coteries for Tolerating Network 2-Partition
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Optimal coteries for rings and related networks
Distributed Computing
The costs and limits of availability for replicated services
ACM Transactions on Computer Systems (TOCS)
Optimal decision strategies in Byzantine environments
Journal of Parallel and Distributed Computing
DISC'05 Proceedings of the 19th international conference on Distributed Computing
| Hi-index | 0.00 |
In a faulty distributed system, voting is commonly used to achieve mutual exclusion among groups of nodes. Each node is assigned a number of votes, and any group with a majority of votes can perform the critical operations. Vote assignments can have a significant impact on system reliability, and in this paper we study the vote assignment problem. To compare vote assignments we define two deterministic measures, node and edge vulnerability. We present various properties of these measures and discuss how they can be computed. For these measures we discuss the selection of the best assignment and propose heuristics to identify good candidate assignments.