Rate Monotonic Scheduling (RMS) policy is a widely accepted scheduling strategy for realtime systems due to strong theoretical foundations and features attractive to practical uses. For a periodic task set of n tasks with deadlines at the end of task periods, it guarantees a feasible schedule on a single processor as long as the utilization factor of the task set is below n(2 1=n ?1) which converges to 0.69 for large n. We analyze the schedulability of the set of periodic tasks that are scheduled by RMS policy and are susceptible to a single fault. The recovery action is the re-execution of all uncompleted tasks. The priority of the RMS policy is maintained even during recovery. Under these conditions, we guarantee that no tasks will miss a single deadline even in the presence of a fault if the utilization factor on the processor does not exceed 0.5. Thus 0.5 is the minimum achievable utilization that permits recovery from faults before the expiration of the deadlines of the tasks. This bound is larger than 0:69=2 = 0:345 that would be obtained if computation times were doubled to provide for re-executions in RMS analysis. This result provides scheduling guarantees for tolerating a variety of intermittent and transient hardware and software faults that can be handled simply by re-execution. In addition, we demonstrate how permanent faults can be tolerated e ciently by maintaining common spares among a set of processors that are independently executing periodic tasks.
For RMS, even if the fault is instantaneous, the utilization bound reduces to 0.5 REF .
Minimum Achievable Utilization for Fault-Tolerant Processing of Periodic Tasks
IEEE Trans. on Computers
Computer Science