The vulnerability of vote assignments
Authors:
Open Access
- 1 August 1986
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computer Systems
- Vol. 4 (3) , 187-213
Abstract
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.Keywords
This publication has 9 references indexed in Scilit:
- How to assign votes in a distributed systemJournal of the ACM, 1985
- Combinatorial Optimization: Algorithms and Complexity.The American Mathematical Monthly, 1984
- A Majority consensus approach to concurrency control for multiple copy databasesACM Transactions on Database Systems, 1979
- Weighted voting for replicated data1979
- The implementation of reliable distributed multiprocess systemsComputer Networks (1976), 1978
- Telecommunications turbulence and the computer network evolutionComputer, 1974
- Analysis and Design of Reliable Computer NetworksIEEE Transactions on Communications, 1972
- Multi-Terminal Network FlowsJournal of the Society for Industrial and Applied Mathematics, 1961
- Congruent Graphs and the Connectivity of GraphsAmerican Journal of Mathematics, 1932