A New Scheduling Approach Supporting Different Fault-tolerant Techniques for Real-time Multiprocessor Systems

Many time-critical applications require predictable performance and tasks in these applications have deadlines to be met even in the presence of faults. Three different approaches have evolved for faulttolerant scheduling of real-time tasks in multiprocessor systems - Triple Modular Redundancy (TMR), Primary Backup (PB), and Imprecise Computation (IC). In TMR approach, the fault detection is by voting, whereas in PB and IC approaches, it is by acceptance test. The different methods employed for error detection in the three approaches often make one approach preferable to the other in certain applications. Also, some applications can have tasks which require more than one fault-tolerant approach. Hence