The DOI matches its Crossref record; 48 of the 48 references it cites were found in a registry or an index.
The consensus problem in fault-tolerant computing
Abstract
article Free Access Share on The consensus problem in fault-tolerant computing Authors: Michael Barborak Univ. of Texas, Austin Univ. of Texas, AustinView Profile , Anton Dahbura Motorola Inc., Cambridge, MA Motorola Inc., Cambridge, MAView Profile , Miroslaw Malek Univ. of Texas, Austin Univ. of Texas, AustinView Profile Authors Info & Claims ACM Computing SurveysVolume 25Issue 2June 1993 pp 171–220https://doi.org/10.1145/152610.152612Published:01 June 1993Publication History 279citation4,634DownloadsMetricsTotal Citations279Total Downloads4,634Last 12 Months183Last 6 weeks34 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
Harary, F. (1969) · Cited by 10,739
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
Bertsekas, D. P., & Gallager, R. G. (1987) · Cited by 5,561
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
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
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
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
Reliable communication in the presence of failures
Birman, K. P., & Joseph, T. A. (1987) · ACM Transactions on Computer Systems · doi:10.1145/7351.7478 · Cited by 997
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
Understanding fault-tolerant distributed systems
Cristian, F. (1991) · Communications of the ACM · doi:10.1145/102792.102801 · Cited by 694
Authenticated Algorithms for Byzantine Agreement
Dolev, D., & Strong, H. R. (1983) · SIAM Journal on Computing · doi:10.1137/0212045 · Cited by 654
On the minimal synchronism needed for distributed consensus
Dolev, D., Dwork, C., & Stockmeyer, L. (1987) · Journal of the ACM · doi:10.1145/7531.7533 · Cited by 620
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
Ben-Or, M. (1983) · Proceedings of the second annual ACM symposium on Principles of distributed computing - PODC '83 · doi:10.1145/800221.806707 · Cited by 590
Rabin, M. O. (1983) · 24th Annual Symposium on Foundations of Computer Science (sfcs 1983) · doi:10.1109/sfcs.1983.48 · Cited by 589
The Byzantine generals strike again
Dolev, D. (1982) · Journal of Algorithms · doi:10.1016/0196-6774(82)90004-9 · Cited by 575
SIFT: Design and analysis of a fault-tolerant computer for aircraft control
Wensley, J. H., Lamport, L., Goldberg, J., Green, M. W., Levitt, K. N., Melliar-Smith, P. M., Shostak, R. E., & Weinstock, C. B. (1978) · Proceedings of the IEEE · doi:10.1109/proc.1978.11114 · Cited by 568
Reaching approximate agreement in the presence of faults
Dolev, D., Lynch, N. A., Pinter, S. S., Stark, E. W., & Weihl, W. E. (1986) · Journal of the ACM · doi:10.1145/5925.5931 · Cited by 525
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
Asynchronous consensus and broadcast protocols
Bracha, G., & Toueg, S. (1985) · Journal of the ACM · doi:10.1145/4221.214134 · Cited by 513
Asynchronous Byzantine agreement protocols
Bracha, G. (1987) · Information and Computation · doi:10.1016/0890-5401(87)90054-x · Cited by 440
A comparison connection assignment for diagnosis of multiprocessor systems
Malek, M. (1980) · Proceedings of the 7th annual symposium on Computer Architecture - ISCA '80 · doi:10.1145/800053.801906 · Cited by 428
Self-citationAnother Advantage of Free Choice: Completely Asynchronous Agreement Protocols
Ben-Or, M. (2000) · Cited by 272
Byzantine generals in action: implementing fail-stop processors
Schneider, F. B. (1984) · ACM Transactions on Computer Systems · doi:10.1145/190.357399 · Cited by 266
Easy impossibility proofs for distributed consensus problems
Fischer, M. J., Lynch, N. A., & Merritt, M. (1986) · Distributed Computing · doi:10.1007/bf01843568 · Cited by 257
Optimal algorithms for Byzantine agreement
Feldman, P., & Micali, S. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62225 · Cited by 255
Replication and fault-tolerance in the ISIS system
Birman, K. P. (1985) · ACM SIGOPS Operating Systems Review · doi:10.1145/323627.323636 · Cited by 245
Bounds on information exchange for Byzantine agreement
Dolev, D., & Reischuk, R. (1985) · Journal of the ACM · doi:10.1145/2455.214112 · Cited by 237
The Weak Byzantine Generals Problem
Lamport, L. (1983) · Journal of the ACM · doi:10.1145/2402.322398 · Cited by 221
The many faces of consensus in distributed systems
Turek, J., & Shasha, D. (1992) · Computer · doi:10.1109/2.153253 · Cited by 176
Extending binary Byzantine agreement to multivalued Byzantine agreement
Turpin, R., & Coan, B. (1984) · Information Processing Letters · doi:10.1016/0020-0190(84)90027-9 · Cited by 152
Replication and fault-tolerance in the ISIS system
Birman, K. (1985) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/323647.323636 · Cited by 150
Towards optimal distributed consensus
Berman, P., Garay, J. A., & Perry, K. J. (1989) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63511 · Cited by 124
Mahaney, S. R., & Schneider, F. B. (1985) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/323596.323618 · Cited by 115
Byzantine clock synchronization
Lamport, L., & Melliar-Smith, P. M. (1984) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/800222.806737 · Cited by 115
Streets of Byzantium: Network Architectures for Fast Reliable Broadcasts
Babaoğlu, Ö., & Drummond, R. (1985) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1985.232247 · Cited by 109
An O (log n ) expected rounds randomized byzantine generals protocol
Bracha, G. F. (1987) · Journal of the ACM · doi:10.1145/31846.42229 · Cited by 102
The Delta-4 extra performance architecture (XPA)
Barrett, P., Hilborne, A. M., Bond, P. G., Seaton, D., Veríssimo, P., Rodrigues, L., & Speirs, N. A. (2002) · IEEE International Symposium on Fault-Tolerant Computing · doi:10.1109/ftcs.1990.89386 · Cited by 93
Bracha, G. F., & Toueg, S. (1983) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/800221.806706 · Cited by 87
Toueg, S., Perry, K. J., & Srikanth, T. K. (1987) · SIAM Journal on Computing · doi:10.1137/0216031 · Cited by 76
Simple constant-time consensus protocols in realistic failure models
Chor, B., Merritt, M., & Shmoys, D. B. (1989) · Journal of the ACM · doi:10.1145/65950.65956 · Cited by 73
Modular construction of a Byzantine agreement protocol with optimal message bit complexity
Coan, B., & Welch, J. L. (1992) · Information and Computation · doi:10.1016/0890-5401(92)90004-y · Cited by 68
A Simple and Efficient Randomized Byzantine Agreement Algorithm
Chor, B., & Coan, B. (1985) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1985.232245 · Cited by 66
Unanimity in an unknown and unreliable environment
Dolev, D. (1981) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1981.53 · Cited by 61
Asymptotically optimal algorithms for approximate agreement
Fekete, A. D. (1990) · Distributed Computing · doi:10.1007/bf01783662 · Cited by 58
Asymptotically optimal algorithms for approximate agreement
Fekete, A. D. (1986) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/10590.10597 · Cited by 52
On the reliability of consensus-based fault-tolerant distributed computing systems
Babaoğlu, Ö. (1987) · ACM Transactions on Computer Systems · doi:10.1145/29868.31332 · Cited by 41
Optimal Diagnosable System Design Using Full-Difference Triangles
Maxemchuk, & Dahbura (1986) · IEEE Transactions on Computers · doi:10.1109/tc.1986.1676844 · Cited by 3
Cited by
FLTrust: Byzantine-robust Federated Learning via Trust Bootstrapping
Cao, X., Fang, M., Liu, J., & Gong, N. Z. (2021) · Proceedings 2021 Network and Distributed System Security Symposium · doi:10.14722/ndss.2021.24434 · Cited by 999
Fundamentals of fault-tolerant distributed computing in asynchronous environments
Gärtner, F. C. (1999) · ACM Computing Surveys · doi:10.1145/311531.311532 · Cited by 346
Metadata
- Authors
- Barborak, M., Dahbura, A., & Malek, M.
- Venue
- ACM Computing Surveys
- Published
- 1993-06
- Volume
- 25
- Issue
- 2
- Pages
- 171-220
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2033579026
- Cited by
- 400
- References
- 48
- FWCI
- 11.16
- 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
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.