Worst Case Timing Requirement of Real-Time Tasks with Time Redundancy

  • Authors:
  • Hyosoon Lee;Heonshik Shin;Sang-Lyul Min

  • Affiliations:
  • -;-;-

  • Venue:
  • RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we predict the worst case timing behavior of real-time tasks that make use of time redundancy including retry, checkpointing and recovery block. Checkpointing is a commonly used technique for reducing the execution time of programs in the presence of transient failures while it requires the additional runtime overhead. Two types of checkpointing, i.e. user level and system level, are considered for analysis.In case of retry, user level checkpointing and recovery block, we derive the worst case timing requirement of task in the presence of $k$ transient faults. This timing requirement includes its computation requirement during fault-free execution, reprocessing time required for tolerating faults and runtime overhead from time redundancy techniques. We also model the timing behavior of system level checkpointing with an additional real-time task that saves the state of all original tasks. The timing information derived in this paper makes time redundancy techniques applicable to real-time systems while keeping the validity of schedulability check developed in the past.