The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Efficient optimistic parallel simulations using reverse computation
Open accessAbstract
In optimistic parallel simulations, state-saving techniques have traditionally been used to realize rollback. In this article, we propose reverse computation as an alternative approach, and compare its execution performance against that of state-saving. Using compiler techniques, we describe an approach to automatically generate reversible computations, and to optimize them to reap the performance benefits of reverse computation transparently. For certain fine-grain models, such as queuing network models, we show that reverse computation can yield significant improvement in execution speed coupled with significant reduction in memory utilization, as compared to traditional state-saving. On sample models using reverse computation, we observe as much as a six-fold improvement in execution speed over traditional state-saving.
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
The thermodynamics of computation—a review
Bennett, C. H. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02084158 · Cited by 2,006
Cited by
Parallel and distributed simulation systems
Fujimoto, R. M. (2002) · Proceeding of the 2001 Winter Simulation Conference (Cat. No.01CH37304) · doi:10.1109/wsc.2001.977259 · Cited by 1,264
Self-citation
Metadata
- Authors
- Carothers, C. D., Perumalla, K. S., & Fujimoto, R. M.
- Venue
- ACM Transactions on Modeling and Computer Simulation
- Published
- 1999-07
- Volume
- 9
- Issue
- 3
- Pages
- 224-253
- ISSN
- 1049-3301 (ISSN-L)
- 1558-1195
- OpenAlex
- W1976533090
- Cited by
- 217
- References
- 1
- FWCI
- 6.45
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Efficient optimistic parallel simulations using reverse computation. https://app.cochat.ai/papers/10.1145/347823.347828
- The paper
- Carothers, C. D., Perumalla, K. S., & Fujimoto, R. M. (1999). Efficient optimistic parallel simulations using reverse computation. ACM Transactions on Modeling and Computer Simulation. https://doi.org/10.1145/347823.347828
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.