The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Exploiting virtual synchrony in distributed systems
Open accessAbstract
We describe applications of a virtually synchronous environment for distributed programming, which underlies a collection of distributed programming tools in the ISIS 2 system. A virtually synchronous environment allows processes to be structured into process groups , and makes events like broadcasts to the group as an entity, group membership changes, and even migration of an activity from one place to another appear to occur instantaneously — in other words, synchronously. A major advantage to this approach is that many aspects of a distributed application can be treated independently without compromising correctness. Moreover, user code that is designed as if the system were synchronous can often be executed concurrently. We argue that this approach to building distributed and fault-tolerant software is more straightforward, more flexible, and more likely to yield correct solutions than alternative approaches.
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
Jefferson, D. R. (1985) · ACM Transactions on Programming Languages and Systems · doi:10.1145/3916.3988 · Cited by 2,397
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
Implementing remote procedure calls
Birrell, A. D., & Nelson, B. J. (1984) · ACM Transactions on Computer Systems · doi:10.1145/2080.357392 · Cited by 1,829
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
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
Self-citationOptimistic recovery in distributed systems
Strom, R., & Yemini, S. (1985) · ACM Transactions on Computer Systems · doi:10.1145/3959.3962 · Cited by 722
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
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
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-citation
Cited by
Robot Operating System 2: Design, architecture, and uses in the wild
Macenski, S., Foote, T., Gerkey, B., Lalancette, C., & Woodall, W. (2022) · Science Robotics · doi:10.1126/scirobotics.abm6074 · Cited by 1,585
(2006) · Technical Report Series 936 · doi:10.2471/trs.02.935 · Cited by 1,096
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-citationThe Chubby lock service for loosely-coupled distributed systems
Burrows, M. (2006) · Operating Systems Design and Implementation · doi:10.5555/1298455.1298487 · Cited by 877
The process group approach to reliable distributed computing
Birman, K. P. (1993) · Communications of the ACM · doi:10.1145/163298.163303 · Cited by 729
Self-citationVan Renesse, R., Birman, K. P., & Vogels, W. (2003) · ACM Transactions on Computer Systems · doi:10.1145/762483.762485 · Cited by 645
Self-citationGroup communication specifications: a comprehensive study
Chockler, G. V., Keidar, I., & Vitenberg, R. (2001) · ACM Computing Surveys · doi:10.1145/503112.503113 · Cited by 630
Don't settle for eventual: scalable causal consistency for wide-area storage with COPS
Lloyd, W., Freedman, M. J., Kaminsky, M., & Andersen, D. G. (2011) · Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles · doi:10.1145/2043556.2043593 · Cited by 565
Detecting causal relationships in distributed computations: In search of the holy grail
Schwarz, R., & Mattern, F. (1994) · Distributed Computing · doi:10.1007/bf02277859 · Cited by 430
Probabilistic reliable dissemination in large-scale systems
Kermarrec, A.-M., Massoulie, L., & Ganesh, A. J. (2003) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2003.1189583 · Cited by 381
Preserving and using context information in interprocess communication
Peterson, L. L., Buchholz, N. C., & Schlichting, R. D. (1989) · ACM Transactions on Computer Systems · doi:10.1145/65000.65001 · Cited by 325
Zab: High-performance broadcast for primary-backup systems
Junqueira, F. P., Reed, B. C., & Serafini, M. (2011) · 2011 IEEE/IFIP 41st International Conference on Dependable Systems & Networks (DSN) · doi:10.1109/dsn.2011.5958223 · Cited by 323
Replication in the harp file system
Liskov, B., Ghemawat, S., Gruber, R., Johnson, P., Shrira, L., & Williams, M. (1991) · Proceedings of the thirteenth ACM symposium on Operating systems principles · doi:10.1145/121132.121169 · Cited by 273
Artificial intelligence moving serious gaming: Presenting reusable game AI components
Westera, W., Prada, R., Mascarenhas, S., Santos, P. A., Dias, J., Guimarães, M., Georgiadis, K., Nyamsuren, E., Bahreini, K., Yumak, Z., et al. (2020) · Education and Information Technologies · doi:10.1007/s10639-019-09968-2 · Cited by 136
Missing the Forest for the Trees: End-to-End AI Application Performance in Edge Data Centers
Richins, D., Doshi, D., Blackmore, M., Thulaseedharan Nair, A., Pathapati, N., Patel, A., Daguman, B., Dobrijalowski, D., Illikkal, R., Long, K., et al. (2020) · 2020 IEEE International Symposium on High Performance Computer Architecture (HPCA) · doi:10.1109/hpca47549.2020.00049 · Cited by 23
ROS-Immunity: Integrated Approach for the Security of ROS-enabled Robotic Systems
Rivera, S., Iannillo, A. K., & State, R. (2020) · doi:10.36227/techrxiv.13013336 · Cited by 2
Metadata
- Authors
- Birman, K., & Joseph, T.
- Venue
- ACM SIGOPS Operating Systems Review
- Published
- 1987-11
- Volume
- 21
- Issue
- 5
- Pages
- 123-138
- ISSN
- 0163-5980 (ISSN-L)
- OpenAlex
- W2131929623
- Cited by
- 601
- References
- 14
- FWCI
- 11.36
- 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.