The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Process structuring, synchronization, and recovery using atomic actions
Abstract
This paper explores the notion of an atomic action as a method of process structuring. This notion, first introduced explicitly by Eswaren et al [6] in the context of data base systems, reduces the problem of coping with many processes to that of coping with a single process within the atomic action . A form of process synchronization, the await statement, is adapted to work naturally with atomic actions. System recovery is also considered and we show how atomic actions can be used to isolate recovery action to a single process. Explicit control of recovery is provided by a reset procedure that permits information from rejected control paths to be passed to subsequent alternative paths.
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
Programming semantics for multiprogrammed computations
Dennis, J. B., & Van Horn, E. C. (1966) · Communications of the ACM · doi:10.1145/365230.365252 · Cited by 575
(1968) · doi:10.1007/978-1-4615-9050-7_2 · Cited by 395
Cited by
(2002) · Choice Reviews Online · doi:10.5860/choice.39-2844 · Cited by 613
Concepts and Notations for Concurrent Programming
Andrews, G. R., & Schneider, F. B. (1983) · ACM Computing Surveys · doi:10.1145/356901.356903 · Cited by 520
Fraser, K. A. (2021) · OpenGrey (Institut de l'Information Scientifique et Technique) · doi:10.48456/tr-579 · Cited by 458
Atomizer: a dynamic atomicity checker for multithreaded programs
Flanagan, C., & Freund, S. N. (2004) · Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/964001.964023 · Cited by 409
Reliability Issues in Computing System Design
Randell, B., Lee, P., & Treleaven, P. C. (1978) · ACM Computing Surveys · doi:10.1145/356725.356729 · Cited by 383
Metadata
- Authors
- Lomet, D. B.
- Venue
- ACM SIGOPS Operating Systems Review
- Published
- 1977-03
- Volume
- 11
- Issue
- 2
- Pages
- 128-137
- ISSN
- 0163-5980 (ISSN-L)
- OpenAlex
- W2157876236
- Cited by
- 173
- References
- 2
- FWCI
- 2.87
- 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.