article

Free access

How to assign votes in a distributed system

Authors:

Hector Garcia-Molina,

Daniel BarbaraAuthors Info & Claims

Journal of the ACM (JACM), Volume 32, Issue 4

Pages 841 - 860

https://doi.org/10.1145/4221.4223

Published: 01 October 1985 Publication History

PDF eReader

Abstract

In a distributed system, one strategy for achieving mutual exclusion of groups of nodes without communication is to assign to each node a number of votes. Only a group with a majority of votes can execute the critical operations, and mutual exclusion is achieved because at any given time there is at most one such group. A second strategy, which appears to be similar to votes, is to define a priori a set of groups that intersect each other. Any group of nodes that finds itself in this set can perform the restricted operations. In this paper, both of these strategies are studied in detail and it is shown that they are not equivalent in general (although they are in some cases). In doing so, a number of other interesting properties are proved. These properties will be of use to a system designer who is selecting a vote assignment or a set of groups for a specific application.

References

[1]

BENZAKEN, C.Critical hypergraphs for the weak chromatic number. J. Comb. Theory, Series B 29, (1980), 328-338.

Google Scholar

[2]

BERGE, C. Graphs and Hypergraphs. American Elsevier, New York, 1973.

Crossref

Google Scholar

[3]

DAVIDSON, S.Evaluation of an optimistic protocol for partitioned distributed database systems. Tech. Rep. 299, Dept. of Electrical Engineering and Comput. Sci., Princeton Univ., May 1982.

Google Scholar

[4]

DOLEV, D., AND STRONG, H. R.polynomial algorithms for multiple processor agreement. In Proceedings of the 14th ACM Symposium on Theory of Computing (San Francisco, Calif., May 5-7). ACM, New York, 1982, pp. 401-407.

Crossref

Google Scholar

[5]

GARCIA-MOLINA, H.Reliability issues for fully replicated distributed databases. IEEE Trans. Comput. 15, 9 (Sept. 1982) 34-42.

Google Scholar

[6]

FFORD, Do K~ Weighted voting for replicated data. In Proceedings of the 7th Symposium on Operating System Principles (Pacific Grove, Calif., Dec.). ACM, New York, 1979, pp. 150-162.

Crossref

Google Scholar

[7]

LAMPORT, L.The implementation of reliable distributed multiprocess systems. Comput. Networks 2 (1978), 95-114.

Google Scholar

[8]

LAMPORT, L., SHOSTAK, R., AND PEASE, M. The Byzantine Generals problem. ACM Trans. Prog. Lang. Syst. 4, 3 (July 1982), 382-401.

Crossref

Google Scholar

[9]

LOVASZ, L. On chromatic number of finite set systems. Acta Math. Acad. Sci. Hungary 19 (I968), 59-67.

Google Scholar

[10]

LOVASZ, L. Coverings and colorings of hypergraphs. In Proceedings of the 4th Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic University). Utilitas Mathematica, Winnipeg, Canada, 1973, pp. 3-12.

Google Scholar

[11]

LYNCH, N. FISCHER, M., AND FOWLER, R. A simple and efficient byzantine generals algorithm. In Proceedings of the 2nd Symposium on Reliability in Distributed Software and Database Systems (Univ. of Pittsburgh, July). iEEE, New York, i982, pp. 46-52.

Google Scholar

[12]

ROTHNIE, J. B., AND GOODMAN, N.A survey of research and development in distributed database management. In Proceedings of the 3rd International Conference on Very Large Database (Tokyo, Japan, Oct. 6-8). ACM, New York, 1977, pp. 48-62.

Google Scholar

[13]

SKEEN, D.A quorum-based commit protocol. In Proceedings of the 6th Berkeley Workshop on Distributed Data Management and Computer Networks (Asilomar, Calif., Feb.). Lawrence Berkeley Laboratories, Berkeley, Calif., 1982, pp. 69-80.

Google Scholar

[14]

SKEEN, D. Crash recovery in a distributed database system. Ph.D. dissertation, Memorandum UCB/ERL M82/45, Univ. of California at Berkeley, Berkelely, Calif. May 1982.

Google Scholar

[15]

THOMAS, R.H. A majority enn~.ngn~ apprnaeh tn ennel~rreney control. ACM Tran~ l)ataha~p Syst. 4, 2 (June 1979), 180-209.

Crossref

Google Scholar

Cited By

View all

Alpos OCachin CTackmann BZanolini L(2024)Asymmetric distributed trustDistributed Computing10.1007/s00446-024-00469-137:3(247-277)Online publication date: 28-May-2024
https://dl.acm.org/doi/10.1007/s00446-024-00469-1
Heydari HSilvestre GBessani A(2023)How Hard is Asynchronous Weight Reassignment?2023 IEEE 43rd International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS57875.2023.00038(523-533)Online publication date: Jul-2023
https://doi.org/10.1109/ICDCS57875.2023.00038
Enokido TDuolikun DTakizawa M(2023)Energy-Saving Multi-version Timestamp Ordering Algorithm for Virtual Machine EnvironmentsComplex, Intelligent and Software Intensive Systems10.1007/978-3-031-35734-3_2(13-20)Online publication date: 19-Jun-2023
https://doi.org/10.1007/978-3-031-35734-3_2
Show More Cited By

Index Terms

How to assign votes in a distributed system

Recommendations

An Integer Programming Approach for Assigning Votes in a Distributed System
SRDS '95: Proceedings of the 14TH Symposium on Reliable Distributed Systems

Voting is a general approach to maintain consistency of replicated data under node failures and network partitions. In voting, each node is assigned a particular number of votes, and any group with majority of votes can perform operations. Votes ...
Single Transferable Votes with Tax Cuts

Some tally methods for preferential elections are discussed from the following point of view: How well do they respect a wish from the voter that subsidiary votes in the ballot cannot hurt the chances of the ballot's top-ranked candidate? The standard ...
Oblivious VotingźHiding Votes from the Voting Machine in Bingo Voting
ICETE 2016: Proceedings of the 13th International Joint Conference on e-Business and Telecommunications

When designing an electronic voting scheme it is notoriously difficult to guarantee the secrecy of the vote

as well as the correctness of the tally, even in the presence of a malicious adversary. Research in (offline)

cryptographic voting schemes has ...

Reviews

Reviewer: Jason Gait

This paper studies the relationship between two methods of deciding whether a subset of the nodes of a distributed system has access to protected data during a partition. A vote assignment is a mapping of nodes into the nonnegative integers, with functional values corresponding to the number of votes assigned to a node: a partition containing the majority of votes has access to the data. A coterie is a collection of pairwise intersecting sets of nodes: a partition containing one of the sets in the coterie is given access to the data. The authors investigate the properties of a particular mapping of vote assignments to coteries. They describe an enumeration algorithm for coteries that successfully enumerates coteries on five nodes, but fails for six nodes. Not all coteries enumerated have corresponding vote assignments. The authors retail the result, attributed to a personal communication of M. Yannakakis, that there are at most 2 n 2 vote assignments and at least 2 2 cn coteries for some c. The imputation is that there are strictly fewer vote assignments than there are coteries for sufficiently large values of n.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Comments

Information & Contributors

Information

Published In

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 1985

Published in JACM Volume 32, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

462
Total Citations
View Citations
1,398
Total Downloads

Downloads (Last 12 months)103
Downloads (Last 6 weeks)16

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Alpos OCachin CTackmann BZanolini L(2024)Asymmetric distributed trustDistributed Computing10.1007/s00446-024-00469-137:3(247-277)Online publication date: 28-May-2024
https://dl.acm.org/doi/10.1007/s00446-024-00469-1
Heydari HSilvestre GBessani A(2023)How Hard is Asynchronous Weight Reassignment?2023 IEEE 43rd International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS57875.2023.00038(523-533)Online publication date: Jul-2023
https://doi.org/10.1109/ICDCS57875.2023.00038
Enokido TDuolikun DTakizawa M(2023)Energy-Saving Multi-version Timestamp Ordering Algorithm for Virtual Machine EnvironmentsComplex, Intelligent and Software Intensive Systems10.1007/978-3-031-35734-3_2(13-20)Online publication date: 19-Jun-2023
https://doi.org/10.1007/978-3-031-35734-3_2
Enokido TDuolikun DTakizawa M(2023)Energy-Efficient Two Phase Locking (2PL) Protocol by Not Performing Meaningless Methods in Virtual Machine EnvironmentsAdvanced Information Networking and Applications10.1007/978-3-031-29056-5_1(1-8)Online publication date: 20-Mar-2023
https://doi.org/10.1007/978-3-031-29056-5_1
Enokido TDuolikun DTakizawa M(2023)Energy-Efficient Locking Protocol in Virtual Machine EnvironmentsAdvances in Internet, Data & Web Technologies10.1007/978-3-031-26281-4_25(248-255)Online publication date: 12-Feb-2023
https://doi.org/10.1007/978-3-031-26281-4_25
Enokido TDuolikun DTakizawa M(2022)An energy-efficient quorum-based locking protocol by omitting meaningless methods on object replicasJournal of High Speed Networks10.3233/JHS-22069028:3(181-203)Online publication date: 1-Jan-2022
https://dl.acm.org/doi/10.3233/JHS-220690
Bläsius TFriedrich TLischeid JMeeks KSchirneck M(2022)Efficiently enumerating hitting sets of hypergraphs arising in data profilingJournal of Computer and System Sciences10.1016/j.jcss.2021.10.002124:C(192-213)Online publication date: 1-Mar-2022
https://dl.acm.org/doi/10.1016/j.jcss.2021.10.002
Enokido TDuolikun DTakizawa M(2022)Multi-Version Concurrency Control to Reduce the Electric Energy Consumption of ServersAdvances on Broad-Band Wireless Computing, Communication and Applications10.1007/978-3-031-20029-8_18(180-191)Online publication date: 18-Oct-2022
https://doi.org/10.1007/978-3-031-20029-8_18
Enokido TDuolikun DTakizawa M(2022)Energy-Efficient Multi-Version Concurrency Control (EEMVCC) for Object-Based SystemsAdvances in Network-Based Information Systems10.1007/978-3-031-14314-4_2(13-24)Online publication date: 12-Aug-2022
https://doi.org/10.1007/978-3-031-14314-4_2
Enokido TDuolikun DTakizawa M(2022)Energy-Efficient Two-Phase Locking Protocol by Omitting Meaningless Read and Write MethodsComplex, Intelligent and Software Intensive Systems10.1007/978-3-031-08812-4_4(26-36)Online publication date: 17-Jun-2022
https://doi.org/10.1007/978-3-031-08812-4_4
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

An Integer Programming Approach for Assigning Votes in a Distributed System

Single Transferable Votes with Tax Cuts

Oblivious VotingźHiding Votes from the Voting Machine in Bingo Voting

Reviews

Access critical reviews of Computing literature here

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations