The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
How to assign votes in a distributed system
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Byzantine generals problem
Lamport, L., Shostak, R., & Pease, M. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357176 · Cited by 6,023
(1973) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(09)x7013-3 · Cited by 2,937
Weighted voting for replicated data
Gifford, D. K. (1979) · Proceedings of the seventh symposium on Operating systems principles - SOSP '79 · doi:10.1145/800215.806583 · Cited by 1,323
A Majority consensus approach to concurrency control for multiple copy databases
Thomas, R. H. (1979) · ACM Transactions on Database Systems · doi:10.1145/320071.320076 · Cited by 1,003
The implementation of reliable distributed multiprocess systems
Lamport, L. (1978) · Computer Networks (1976) · doi:10.1016/0376-5075(78)90045-4 · Cited by 233
Polynomial algorithms for multiple processor agreement
Dolev, D., & Strong, H. R. (1982) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800070.802215 · Cited by 153
A survey of research and development in distributed database management
Rothnie, J. B., & Goodman, N. (1977) · Very Large Data Bases · Cited by 103
A Simple and Efficient Byzantine Generals Algorithm.
Lynch, N., Fischer, M. J., & Fowler, R. J. (1982) · Defense Technical Information Center (DTIC) · doi:10.21236/ada113241 · Cited by 57
Cited by
The dangers of replication and a solution
Gray, J., Helland, P., O'Neil, P., & Shasha, D. (1996) · Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96 · doi:10.1145/233269.233330 · Cited by 1,019
On generating all maximal independent sets
Johnson, D. S., Yannakakis, M., & Papadimitriou, C. H. (1988) · Information Processing Letters · doi:10.1016/0020-0190(88)90065-8 · Cited by 771
(2002) · Choice Reviews Online · doi:10.5860/choice.39-2844 · Cited by 613
Malkhi, D., & Reiter, M. (1998) · Distributed Computing · doi:10.1007/s004460050050 · Cited by 530
Identifying the Minimal Transversals of a Hypergraph and Related Problems
Eiter, T., & Gottlob, G. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539793250299 · Cited by 437
Metadata
- Authors
- Garcia-Molina, H., & Barbara, D.
- Venue
- Journal of the ACM
- Published
- 1985-10
- Volume
- 32
- Issue
- 4
- Pages
- 841-860
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2052960791
- Cited by
- 563
- References
- 8
- FWCI
- 7.33
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.