The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Byzantine generals in action: implementing fail-stop processors
Open accessAbstract
A fail-stop processor halts instead of performing an erroneous state transformation that might be visible to other processors, can detect whether another fail-stop processor has halted (due to a failure), and has a predefined portion of its storage that will remain unaffected by failures and accessible to any other fail-stop processor.Fail-stop processors can simplify the construction of fault-tolerant computing systems.In this paper, the problem of approximating fail-stop processors is discussed.Use of fail-stop processors is compared with the state machine approach, another general paradigm for constructing fault-tolerant systems.
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 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
Reaching Agreement in the Presence of Faults
Pease, M., Shostak, R., & Lamport, L. (1980) · Journal of the ACM · doi:10.1145/322186.322188 · Cited by 2,359
Time, clocks, and the ordering of events in a distributed system
Massachusetts Computer Associates, I., & Lamport, L. (2019) · Concurrency: the Works of Leslie Lamport · doi:10.1145/3335772.3335934 · Cited by 1,979
Fail-stop processors: an approach to designing fault-tolerant computing systems
Schlichting, R. D., & Schneider, F. B. (1983) · ACM Transactions on Computer Systems · doi:10.1145/357369.357371 · Cited by 769
Self-citationProceedings of the 50th Hawaii International Conference on System Sciences (2017)
(2017) · Proceedings of the Annual Hawaii International Conference on System Sciences · doi:10.24251/hicss.2017.000 · Cited by 737
The Byzantine generals strike again
Dolev, D. (1982) · Journal of Algorithms · doi:10.1016/0196-6774(82)90004-9 · Cited by 575
A lower bound for the time to assure interactive consistency
Fischer, M. J., & Lynch, N. A. (1982) · Information Processing Letters · doi:10.1016/0020-0190(82)90033-3 · Cited by 519
Using Time Instead of Timeout for Fault-Tolerant Distributed Systems.
Lamport, L. (1984) · ACM Transactions on Programming Languages and Systems · doi:10.1145/2993.2994 · Cited by 335
The implementation of reliable distributed multiprocess systems
Lamport, L. (1978) · Computer Networks (1976) · doi:10.1016/0376-5075(78)90045-4 · Cited by 233
Proceedings of the 54th Hawaii International Conference on System Sciences
(2021) · Proceedings of the Annual Hawaii International Conference on System Sciences · doi:10.24251/hicss.2021.000 · Cited by 171
Synchronization in Distributed Programs
Schneider, F. B. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357162.357163 · Cited by 142
Self-citationA 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
Implementing fault-tolerant services using the state machine approach: a tutorial
Schneider, F. B. (1990) · ACM Computing Surveys · doi:10.1145/98163.98167 · Cited by 2,387
Self-citationA case for end system multicast
Chu, Y.-H., Rao, S. G., Seshan, S., & Zhang, H. (2002) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.803066 · Cited by 2,202
Consensus in the presence of partial synchrony
Dwork, C., Lynch, N., & Stockmeyer, L. (1988) · Journal of the ACM · doi:10.1145/42282.42283 · Cited by 1,909
FAWN: a fast array of wimpy nodes
Andersen, D. G., Franklin, J., Kaminsky, M., Phanishayee, A., Tan, L., & Vasudevan, V. (2009) · Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles · doi:10.1145/1629575.1629577 · Cited by 561
The consensus problem in fault-tolerant computing
Barborak, M., Dahbura, A., & Malek, M. (1993) · ACM Computing Surveys · doi:10.1145/152610.152612 · Cited by 400
Metadata
- Authors
- Schneider, F. B.
- Venue
- ACM Transactions on Computer Systems
- Published
- 1984-05
- Volume
- 2
- Issue
- 2
- Pages
- 145-154
- ISSN
- 0734-2071 (ISSN-L)
- 1557-7333
- OpenAlex
- W2089138728
- Cited by
- 266
- References
- 13
- FWCI
- 5.44
- 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.