The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Preserving and using context information in interprocess communication
Open accessAbstract
When processes in a network communicate, the messages they exchange define a partial ordering of externally visible events. While the significance of this partial order in distributed computing is well understood, it has not been made an explicit part of the communication substrate upon which distributed programs are implemented. This paper describes a new interprocess communication mechanism, called Psync, that explicitly encodes this partial ordering with each message. The paper shows how Psync can be efficiently implemented on an unreliable communications network, and it demonstrates how conversations serve as an elegant foundation for ordering messages exchanged in a distributed computation and for recovering from processor failures.
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
(2011) · SpringerReference · doi:10.1007/springerreference_27387 · Cited by 3,053
Postel, J. (1980) · doi:10.17487/rfc0768 · Cited by 2,223
End-To-End Arguments In System Design
And, S. R., Saltzer, J. H., Reed, D. P., & Clark, D. D. (1984) · Cited by 2,130
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
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
Postel, J. B. (1981) · Cited by 1,130
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
Optimistic recovery in distributed systems
Strom, R., & Yemini, S. (1985) · ACM Transactions on Computer Systems · doi:10.1145/3959.3962 · Cited by 722
The Transitive Reduction of a Directed Graph
Aho, A. V., Garey, M. R., & Ullman, J. D. (1972) · SIAM Journal on Computing · doi:10.1137/0201008 · Cited by 718
Exploiting virtual synchrony in distributed systems
Birman, K., & Joseph, T. (1987) · ACM SIGOPS Operating Systems Review · doi:10.1145/37499.37515 · Cited by 601
Postel, J. B. (1981) · doi:10.17487/rfc0788 · Cited by 506
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
Exploiting virtual synchrony in distributed systems
Birman, K., & Joseph, T. (1987) · Proceedings of the eleventh ACM Symposium on Operating systems principles - SOSP '87 · doi:10.1145/41457.37515 · Cited by 265
Synchronization in Distributed Programs
Schneider, F. B. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357162.357163 · Cited by 142
Recovery in distributed systems using optimistic message logging and checkpointing
Johnson, D. B., & Willy Zwaenepoel, Y. (1990) · Journal of Algorithms · doi:10.1016/0196-6774(90)90022-7 · Cited by 117
Recovery in distributed systems using asynchronous message logging and checkpointing
Johnson, D. B., & Willy Zwaenepoel, Y. (1988) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/62546.62575 · Cited by 79
Hutchinson, N. C., & Peterson, L. (1988) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/52324.52332 · Cited by 57
Self-citationRemote pipes and procedures for efficient distributed communication
Gifford, D. K., & Glasser, N. (1988) · ACM Transactions on Computer Systems · doi:10.1145/45059.45061 · Cited by 54
Cited by
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
A survey of rollback-recovery protocols in message-passing systems
Elnozahy, E. N. (., Alvisi, L., Wang, Y.-M., & Johnson, D. B. (2002) · ACM Computing Surveys · doi:10.1145/568522.568525 · Cited by 1,804
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
The process group approach to reliable distributed computing
Birman, K. P. (1993) · Communications of the ACM · doi:10.1145/163298.163303 · Cited by 729
Metadata
- Authors
- Peterson, L. L., Buchholz, N. C., & Schlichting, R. D.
- Venue
- ACM Transactions on Computer Systems
- Published
- 1989-08
- Volume
- 7
- Issue
- 3
- Pages
- 217-246
- ISSN
- 0734-2071 (ISSN-L)
- 1557-7333
- OpenAlex
- W2044052675
- Cited by
- 325
- References
- 19
- FWCI
- 21.40
- 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.