Schedulability Analysis for Fault-Tolerant Hard Real-Time Tasks with Arbitrary Large Deadlines

Abstract

Schedulability analysis based the worst-case response time is an important research issue in real-time systems. Due to the restriction that the traditional schedulability analysis for fault-tolerant real-time systems only considered that the deadline of each task must be no larger than its period, this paper extends the computation model that the deadline of each task can be longer than its period. Based on the worst-case response time schedulability analysis for fault-tolerant hard real-time task set, we present a fault-tolerant priority assignment algorithm for our proposed computation model. This algorithm can be useful, together with schedulability analysis, especially for the real-time communication systems and distribution systems.