OPTIMAL CHECKPOINTING OF REAL-TIME TASKS.

Kang G. Shin, Tein Hsiang Lin, Yann Hang Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

Abstract

Analytical models for the design and evaluation of checkpointing of real-time tasks are developed. First, the execution of a real-time tasks is modeled under a commong assumption of perfect coverage on online detection mechanisms (which is termed a basic model). Then, the model is generalized (to an extended model) to include more realistic cases, i. e. , imperfect coverages of online detection mechanisms and acceptance tests. Finally, an optimal placement of checkpoints is determined that will minimize the mean task execution time while the probability of an unreliable result (or lack of confidence) is kept below a specified level. In the basic model, it is shown that equidistant intercheckpoint intervals are optimal, whereas this is not necessarily true for the extended model. An algorithm for calculating the optimal number of checkpoints and intercheckpoint intervals is presented with some numerical examples for the extended model.

Original languageEnglish (US)
Title of host publicationProceedings - Symposium on Reliability in Distributed Software and Database Systems
PublisherIEEE
Pages151-158
Number of pages8
ISBN (Print)0818606908
StatePublished - Jan 1 1986
Externally publishedYes

Publication series

NameProceedings - Symposium on Reliability in Distributed Software and Database Systems

ASJC Scopus subject areas

  • Software

Fingerprint Dive into the research topics of 'OPTIMAL CHECKPOINTING OF REAL-TIME TASKS.'. Together they form a unique fingerprint.

Cite this