The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Elections in a Distributed Computing System
Abstract
After a failure occurs in a distributed computing system, it is often necessary to reorganize the active nodes so that they can continue to perform a useful task. The first step in such a reorganization or reconfiguration is to elect a coordinator node to manage the operation. This paper discusses such elections and reorganizations. Two types of reasonable failure environments are studied. For each environment assertions which define the meaning of an election are presented. An election algorithm which satisfies the assertions is presented for each environment.
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
Time, clocks, and the ordering of events in a distributed system
Lamport, L. (1978) · Communications of the ACM · doi:10.1145/359545.359563 · Cited by 8,488
The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver
Smith (1980) · IEEE Transactions on Computers · doi:10.1109/tc.1980.1675516 · Cited by 3,716
Algebraic Coding Theory: Revised Edition
Berlekamp, E. R. (2015) · WORLD SCIENTIFIC eBooks · doi:10.1142/9407 · Cited by 2,474
Notes on data base operating systems
Gray, J. N. (1978) · Lecture Notes in Computer Science · doi:10.1007/3-540-08755-9_9 · Cited by 1,656
Ethernet: distributed packet switching for local computer networks
Metcalfe, R. M., & Boggs, D. R. (1983) · Communications of the ACM · doi:10.1145/357980.358015 · Cited by 1,509
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
Biggs, N. L. (2008) · Springer Undergraduate Mathematics Series · doi:10.1007/978-1-84800-273-9_9 · Cited by 751
Solution of a problem in concurrent programming control
Dijkstra, E. (1965) · Communications of the ACM · doi:10.1145/365559.365617 · Cited by 749
Detection of Mutual Inconsistency in Distributed Systems
Parker, D. S., Popek, G. J., Rudisin, G., Stoughton, A., Walker, B. J., Walton, E., Chow, J., Edwards, D., Kiser, S., & Kline, C. S. (1983) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1983.236733 · Cited by 356
What is a "Distributed" Data Processing System?
Enslow, P. H. (1978) · Computer · doi:10.1109/c-m.1978.217901 · Cited by 246
Cited by
Impossibility of distributed consensus with one faulty process
Fischer, M. J., Lynch, N. A., & Paterson, M. S. (1985) · Journal of the ACM · doi:10.1145/3149.214121 · Cited by 4,579
The Future Renewable Electric Energy Delivery and Management (FREEDM) System: The Energy Internet
Huang, A. Q., Crow, M. L., Heydt, G. T., Zheng, J. P., & Dale, S. J. (2011) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2081330 · Cited by 1,463
Wolski, R., Spring, N. T., & Hayes, J. (1999) · Future Generation Computer Systems · doi:10.1016/s0167-739x(99)00025-4 · Cited by 1,291
Metadata
- Authors
- Garcia-Molina
- Venue
- IEEE Transactions on Computers
- Published
- 1982-01
- Volume
- C-31
- Issue
- 1
- Pages
- 48-59
- ISSN
- 0018-9340 (ISSN-L)
- 1557-9956
- 2326-3814
- OpenAlex
- W2071187449
- Cited by
- 620
- References
- 13
- FWCI
- 10.97
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Elections in a Distributed Computing System. https://app.cochat.ai/papers/10.1109/tc.1982.1675885
- The paper
- Garcia-Molina. (1982). Elections in a Distributed Computing System. IEEE Transactions on Computers. https://doi.org/10.1109/tc.1982.1675885
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.
