Recursive restartability: turning the reboot sledgehammer into a scalpel
Open accessThe DOI matches its Crossref record.
Abstract
Even after decades of software engineering research, complex computer systems still fail, primarily due to nondeterministic bugs that are typically resolved by rebooting. Conceding that Heisenbugs will remain a fact of life, we propose a systematic investigation of restarts as "high availability medicine." In this paper we show how recursive restartability (RR) - the ability of a system to gracefully tolerate restarts at multiple levels improves fault tolerance, reduces time-to-repair and enables system designers to build flexible, highly available software infrastructures. Using several examples of widely deployed software systems, we identify properties that are required of RR systems and outline an agenda for turning the recursive restartability philosophy into a practical software structuring tool. Finally, we describe infrastructural support for RR systems, along with initial ideas on how to analyze and benchmark such systems.
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
Cited by
Automatically patching errors in deployed software
Perkins, J. H., Kim, S., Larsen, S., Amarasinghe, S., Bachrach, J., Carbin, M., Pacheco, C., Sherwood, F., Sidiroglou, S., Sullivan, G., et al. (2009) · Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles · doi:10.1145/1629575.1629585 · Cited by 409
Microreboot -- A Technique for Cheap Recovery
Candea, G., Kawamoto, S., Fujiki, Y., Friedman, G., & Fox, A. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0406005 · Cited by 380
Self-citationImproving the reliability of commodity operating systems
Swift, M. M., Bershad, B. N., & Levy, H. M. (2005) · ACM Transactions on Computer Systems · doi:10.1145/1047915.1047919 · Cited by 338
Automatic Software Repair: A Bibliography
Monperrus, M. (2019) · ACM Computing Surveys · doi:10.1145/3105906 · Cited by 321
Analyzing and Increasing the Reliability of Convolutional Neural Networks on GPUs
Santos, F. F. D., Pimenta, P. F., Lunardi, C., Draghetti, L., Carro, L., Kaeli, D., & Rech, P. (2019) · IEEE Transactions on Reliability · doi:10.1109/tr.2018.2878387 · Cited by 226
“However, the system must be able to recover before causing any harm to the environment [59].”
BackgroundGestalt: integrated support for implementation and analysis in machine learning
Patel, K., Bancroft, N., Drucker, S. M., Fogarty, J., Ko, A. J., & Landay, J. (2010) · Proceedings of the 23nd annual ACM symposium on User interface software and technology · doi:10.1145/1866029.1866038 · Cited by 112
“Within computer science, machine learning can reduce system downtime [3] and detect anomalous network behavior [5].”
BackgroundEvaluation of Histogram of Oriented Gradients Soft Errors Criticality for Automotive Applications
Fernandes, F., Weigel, L., Jung, C., Navaux, P., Carro, L., & Rech, P. (2016) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/2998573 · Cited by 14
“Crash detection and recovery in a real-time system, however, must be quick enough to allow the system to recover without missing deadlines [Candea and Fox 2001; Lee and Sha 2005; Wu et al. 2006].”
Background
Metadata
- Authors
- Candea, G., & Fox, A.
- Venue
- Proceedings Eighth Workshop on Hot Topics in Operating Systems
- Publisher
- IEEE Comput. Soc
- Published
- 2005-08-25
- Pages
- 125-130
- OpenAlex
- W2107635250
- Cited by
- 138
- References
- 0
- FWCI
- 9.43
- Type
- conference paper
- Language
- en
- Open access
- green
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.