Abstract
This paper presents an optimal checkpoint strategy for fault-tolerance in real-time systems. In our environment, multiple real-time tasks with arbitrary periods are scheduled in the system by Rate Monotonie (RM) algorithm, and checkpoints are inserted at a constant interval in each task while the width of interval is different with respect to the task. We propose a method to determine the optimal checkpoint interval for each task so that the probability of completing all the tasks is maximized. Whenever a fault occurs to a checkpoint interval of a task, the execution time of the task would be prolonged by rollback and re-execution of checkpoints. Our scheme includes the schedulability test to examine whether a task can be completed with an extended execution time. A numerical experiment is conducted to demonstrate the applicability of the proposed scheme.
| Original language | English |
|---|---|
| Pages (from-to) | 193-200 |
| Number of pages | 8 |
| Journal | Transactions of the Korean Institute of Electrical Engineers |
| Volume | 60 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jan 2011 |
Keywords
- Arbitrary period
- Checkpointing
- Fault-tolerance
- Rate monotonic (RM) scheduling
- Real-time systems
Fingerprint
Dive into the research topics of 'Optimizing checkpoint intervals for real-time multi-tasks with arbitrary periods'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver