Checkpointing strategy for multiple real-time tasks
نویسندگان
چکیده
We analyze checkpointing strategy for multiple realtime tasks with deadlines. Real-time tasks usually have deadlines associated with them. For multiple real-time tasks, checkpointing strategy considering deadlines of all tasks is very difficult to derive. We analyze the problem of checkpoint placement for such multiple tasks. In our strategy, the interval between checkpoints are determined for each task. An approximated failure probability over a specified interval is derived. Then the number of checkpoints for each task is selected to minimize the approximated failure probability. To show the usefulness of our strategy, error bound between the exact and the approximated failure probability is estimated, which is revealed to be quite small.
منابع مشابه
An optimal checkpointing-strategy for real-time control systems under transient faults
Real-time computer systems are often used in harsh environments, such as aerospace, and in industry. Such systems are subject to many transient faults while in operation. Checkpointing enables a reduction in the recovery time from a transient fault by saving intermediate states of a task in a reliable storage facility, and then, on detection of a fault, restoring from a previously stored state....
متن کاملAdaptive Checkpointing Schemes for Fault Tolerance in Real-Time Systems with Task Duplication
Dynamic adaptation techniques based on checkpointing is studied in this paper. Placing store-checkpoints and compare-checkpoints between CSCP (store-and-compare-checkpoint), we first present adaptive checkpointing schemes in which the checkpointing interval for a task is dynamically adjusted on line. Introducing the overheads of comparison and storage, the average execution times to complete a ...
متن کاملPerformance and Effectiveness Analysis of Checkpointing in Mobile Environments
Many mathematical models have been proposed to evaluate the execution performance of an application with and without checkpointing in the presence of failures. They assume that the total program execution time without failure is known in advance, under which condition the optimal checkpointing interval can be determined. In mobile environments, application components are distributed and tasks a...
متن کاملNon-Preemptive Real Time Scheduling using Checkpointing Algorithm for Cloud Computing
This paper focuses on providing a solution for online real time services using non-preemptive scheduling algorithm in order to minimize the execution time of the migrated tasks. Earlier, a non-preemptive scheduling with task migration algorithm is used to minimize the penalty. Whenever a task misses its deadline, it will migrate the task to another virtual machine and starts its execution from ...
متن کاملCheckpointing for the Reliability of Real-Time Systems with On-Line Fault Detection
The checkpointing problem in real-time systems equipped with on-line fault detection mechanisms is dealt with from a reliability point of view. The reliability analysis is performed with the assumption that transient faults occur in accordance with a Poisson process and are detected immediately by the detection mechanisms. And the best equidistant checkpointing strategy that maximizes the relia...
متن کامل