The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Debugging Parallel Programs with Instant Replay
Abstract
The debugging cycle is the most common methodology for finding and correcting errors in sequential programs. Cyclic debugging is effective because sequential programs are usually deterministic. Debugging parallel programs is considerably more difficult because successive executions of the same program often do not produce the same results. In this paper we present a general solution for reproducing the execution behavior of parallel programs, termed Instant Replay. During program execution we save the relative order of significant events as they occur, not the data associated with such events. As a result, our approach requires less time and space to save the information needed for program replay than other methods. Our technique is not dependent on any particular form of interprocess communication. It provides for replay of an entire program, rather than individual processes in isolation. No centralized bottlenecks are introduced and there is no need for synchronized clocks or a globally consistent logical time. We describe a prototype implementation of Instant Replay on the BBN Butterfly™ Parallel Processor, and discuss how it can be incorporated into the debugging cycle for parallel programs.
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
Distributed snapshots: determining global states of distributed systems
Chandy, K. M., & Lamport, L. (1985) · ACM Transactions on Computer Systems · doi:10.1145/214451.214456 · Cited by 2,443
Monitors: an operating system structuring concept
Hoare, C. A. R. (1974) · Communications of the ACM · doi:10.1145/355620.361161 · Cited by 1,496
The structure of the “THE”-multiprogramming system
Dijkstra, E. W. (1968) · Communications of the ACM · doi:10.1145/363095.363143 · Cited by 1,094
High-level debugging of distributed systems: The behavioral abstraction approach
Bates, P. C., & Wileden, J. C. (1983) · Journal of Systems and Software · doi:10.1016/0164-1212(83)90011-0 · Cited by 143
Breakpoints and halting in distributed programs
Miller, B. P., & Choi, J.-M. (2003) · Proceedings of the ... International Conference on Distributed Computing Systems/Proceedings of the International Conference on Distributed Computing Systems · doi:10.1109/dcs.1988.12532 · Cited by 121
Debugging a Distributed Computing System
García-Molina, H., Germano, F., & Kohler, W. H. (1984) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1984.5010224 · Cited by 93
Cited by
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
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
A "flight data recorder" for enabling full-system multiprocessor deterministic replay
Xu, M., Bodik, R., & Hill, M. D. (2003) · Proceedings of the 30th annual international symposium on Computer architecture - ISCA '03 · doi:10.1145/859618.859633 · Cited by 395
Kendo: efficient deterministic multithreading in software
Olszewski, M., Ansel, J., & Amarasinghe, S. (2009) · Proceedings of the 14th international conference on Architectural support for programming languages and operating systems · doi:10.1145/1508244.1508256 · Cited by 380
Paranoid Android: versatile protection for smartphones
Portokalidis, G., Homburg, P., Anagnostakis, K., & Bos, H. (2010) · Proceedings of the 26th Annual Computer Security Applications Conference · doi:10.1145/1920261.1920313 · Cited by 350
Metadata
- Authors
- Leblanc, & Mellor-Crummey
- Venue
- IEEE Transactions on Computers
- Published
- 1987-04
- Volume
- C-36
- Issue
- 4
- Pages
- 471-482
- ISSN
- 0018-9340 (ISSN-L)
- OpenAlex
- W1877496576
- Cited by
- 763
- References
- 7
- FWCI
- 103.77
- 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.