Fault-Tolerant Real-Time Scheduling using Chip Multiprocessor

Failure to meet task deadline in safety critical real-time systems can be catastrophic. Moreover, fault tolerance is a crucial aspect of such systems if faults are likely. In this work, fault tolerance in real-time systems is proposed using time redundancy to mask at most F transient faults. Schedulability of a set of n preemptive real-time periodic tasks using Rate-Monotonic(RM) schedule in chip multiprocessor (CMP) is considered. Chip multiprocessor rather than uniprocessor is proposed to make more CPU time available before deadline of tasks. This paper addresses the issue of finding maximum number of tasks that can run in parallel at a particular time and also finds minimum number of processing cores required in a CMP, denoted by MinC, to make the real-time system task set schedulable. A real-time fault-tolerant algorithm FT-RT-CMP for scheduling tasks using MinC cores is also developed considering the worst case distribution of F transient faults