The DOI matches its Crossref record.
On the completion time distribution for tasks that must restart from the beginning if a failure occurs
Abstract
For many systems, failure is so common that the design choice of how to deal with it may have a significant impact on the performance of the system. There are many specific and distinct failure recovery schemes, but they can be grouped into three broad classes: RESUME , also referred to as preemptive resume (prs), or check-pointing; REPLACE , also referred to as preemptive repeat different (prd); and RESTART , also referred to as preemptive repeat identical (pri). The following describes the three recovery schemes: (1) RESUME: when a task is fails, it knows exactly where it stops, and can continue from that point when allowed to resume; (2) REPLACE: given a task fails, then when it begins processing again, it starts with a brand new task sampled from the same task time distribution; and, (3) RESTART: When a task fails, it loses all that it had acquired to up to that point and must start anew when upon continuing later. This is distinctly different from (2) since the task must run at least as long as it did before it failed, whereas a new sample, selected at random, might run for a shorter or longer time.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Restart mechanisms may result in long-tailed (power law) delays even if job sizes and failure rates are exponential.
“It was first recognized in [6] and [19] that such mechanisms may result in long-tailed (power law) delays even if the job sizes and failure rates are exponential.”
From Distribution of the Number of Retransmissions of Bounded Documents (2015) · cites this paper as [19]
Citations
Cites
No references could be resolved yet.
Research works printed but not linked: 2
- 10.1145/1101892.1101898 · DOI · Paper page
- 10.2307/1427109 · DOI
Cited by
Sorted by citations
Distribution of the Number of Retransmissions of Bounded Documents
Jelenković, P. R., & Skiani, E. D. (2015) · Advances in Applied Probability · doi:10.1239/aap/1435236982 · Cited by 7
Metadata
- Authors
- Sheahan, R., Lipsky, L., Fiorini, P. M., & Asmussen, S.
- Affiliations
- University of Connecticut (US)
- University of Southern Maine (US)
- Aarhus University (DK)
- ORCID
- Asmussen, Søren
- Venue
- ACM SIGMETRICS Performance Evaluation Review
- Published
- 2006-12
- Volume
- 34
- Issue
- 3
- Pages
- 24-26
- ISSN
- 0163-5999 (ISSN-L)
- OpenAlex
- W2089589825
- Cited by
- 45
- References
- 0
- Citations by year
- 2025: 1 · 2024: 3 · 2023: 1 · 2022: 1 · 2019: 3 · 2016: 2 · 2015: 6 · 2014: 3 · 2013: 6 · 2012: 5
- FWCI
- 2.97
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- ACM SIGMETRICS Performance Evaluation Review (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Distributed systems and fault tolerance
- Physical Sciences › Engineering › Safety, Risk, Reliability and Quality › Reliability and Maintenance Optimization
- Physical Sciences › Computer Science › Computer Networks and Communications › Software System Performance and Reliability
- Keywords
- checkpointing, task failure
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