The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Reliable communication in the presence of failures
Open accessAbstract
The design and correctness of a communication facility for a distributed computer system are reported on. The facility provides support for fault-tolerant process groups in the form of a family of reliable multicast protocols that can be used in both local- and wide-area networks. These protocols attain high levels of concurrency, while respecting application-specific delivery ordering constraints, and have varying cost and performance that depend on the degree of ordering desired. In particular, a protocol that enforces causal delivery orderings is introduced and shown to be a valuable alternative to conventional asynchronous communication protocols. The facility also ensures that the processes belonging to a fault-tolerant process group will observe consistent orderings of events affecting the group as a whole, including process failures, recoveries, migration, and dynamic changes to group properties like member rankings. A review of several uses for the protocols in the ISIS system, which supports fault-tolerant resilient objects and bulletin boards, illustrates the significant simplification of higher level algorithms made possible by our approach.
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
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
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
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
Concurrency Control in Distributed Database Systems
Bernstein, P. A., & Goodman, N. (1981) · ACM Computing Surveys · doi:10.1145/356842.356846 · Cited by 1,186
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
Distributed process groups in the V Kernel
Cheriton, D. R., & Zwaenepoel, W. (1985) · ACM Transactions on Computer Systems · doi:10.1145/214438.214439 · Cited by 353
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
Self-citationAn efficient, fault-tolerant protocol for replicated data management
Abbadi, A. E., Skeen, D., & Cristian, F. (1985) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/325405.325443 · Cited by 222
Low cost management of replicated data in fault-tolerant distributed systems
Joseph, T., & Birman, K. (1986) · ACM Transactions on Computer Systems · doi:10.1145/6306.6309 · Cited by 89
Self-citationReplicated distributed programs
Cooper, E. C. (1985) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/323647.323635 · Cited by 89
Schneider, F. B., Gries, D. J., & Schlichting, R. D. (1984) · Science of Computer Programming · doi:10.1016/0167-6423(84)90009-1 · Cited by 84
A recovery algorithm for a distributed database system
Goodman, N., Skeen, D., Chan, A., Dayal, U., Fox, S., & Ries, D. R. (1983) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/588058.588061 · Cited by 64
Determining the last process to fail
Skeen, D. (1985) · ACM Transactions on Computer Systems · doi:10.1145/214451.214453 · Cited by 52
Cited by
(1992) · Lecture Notes in Computer Science · doi:10.1007/bfb0022433 · Cited by 3,955
Unreliable failure detectors for reliable distributed systems
Chandra, T. D., & Toueg, S. (1996) · Journal of the ACM · doi:10.1145/226643.226647 · Cited by 2,513
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
Lightweight causal and atomic group multicast
Birman, K., Schiper, A., & Stephenson, P. (1991) · ACM Transactions on Computer Systems · doi:10.1145/128738.128742 · Cited by 956
Self-citationSaito, Y., & Shapiro, M. (2005) · ACM Computing Surveys · doi:10.1145/1057977.1057980 · Cited by 739
Metadata
- Authors
- Birman, K. P., & Joseph, T. A.
- Venue
- ACM Transactions on Computer Systems
- Published
- 1987-01-05
- Volume
- 5
- Issue
- 1
- Pages
- 47-76
- ISSN
- 0734-2071 (ISSN-L)
- 1557-7333
- OpenAlex
- W2118153508
- Cited by
- 997
- References
- 13
- FWCI
- 29.54
- 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.