Probabilistic language analysis of weighted voting algorithms

Authors:
Louise E. Moser;Vikas Kapur;P. M. Melliar-Smith
Affiliations:
Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA;Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA;Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA
Venue:
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Year:
1990

Citing 8
Cited 0

How to assign votes in a distributed system

Journal of the ACM (JACM)
A quorum-consensus replication method for abstract data types

ACM Transactions on Computer Systems (TOCS)
The Reliability of Voting Mechanisms

IEEE Transactions on Computers
Performance Characterization of Quorum-Consensus Algorithms for Replicated Data

IEEE Transactions on Software Engineering
A Majority consensus approach to concurrency control for multiple copy databases

ACM Transactions on Database Systems (TODS)
Broadcast Protocols for Distributed Systems

IEEE Transactions on Parallel and Distributed Systems
Optimizing Vote and Quorum Assignments for Reading and Writing Replicated Data

Proceedings of the Fifth International Conference on Data Engineering
Weighted voting for replicated data

SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a method of analyzing the performance of weighted voting algorithms in a fault-tolerant distributed system. In many distributed systems, some processors send messages more frequently than others and all processors share a common communication medium, such as an Ethernet. Typical fault-tolerant voting algorithms require that a certain minimum number of votes be collected from different processors. System performance is significantly affected by the time required to collect those votes. We formulate the problem of weighted voting in terms of probabilistic languages and then use the calculus of generating functions to compute the expected delay to collect that number of votes. An application of the method to a particular voting algorithm, the Total protocol, is given.