A weighted voting algorithm for replicated directories

DOI10.1145/31846.31847MaRDI QIDQ3766831zbMATH OpenOpenAlexFDO

Authors Joshua Bloch, Dean S. Daniels, Alfred Spector

Publication date 1987

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://figshare.com/articles/journal_contribution/A_weighted_voting_algorithm_for_replicated_directories/6602888

zbMATH Keywords

distributed algorithmsconcurrencyefficient algorithmsreplicated abstract data typesdistributed transaction systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of operating systems (68N25)

Recommendations

• The availability of quorum systems
• Response time behavior of distributed voting algorithms for managing replicated data
• A dynamic majority determination algorithm for reconfiguration of network partitions
• An optimal voting scheme for minimizing the overall communication cost in replicated data management
• Optimistic voting for managing replicated data

Cited in

(3)

• A dynamic majority determination algorithm for reconfiguration of network partitions
• A general stability analysis on regional and national voting schemes against noise -- why is an electoral college more stable than a direct popular election?
• Response time behavior of distributed voting algorithms for managing replicated data

This page was built for publication: A weighted voting algorithm for replicated directories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3766831)