Fault-Tolerant Rate-Monotonic Scheduling with Resource Reclaim

Fault-tolerant real-time scheduling algorithm through time redundancy, whose schedulability bound is based on the worst execution time of tasks and the time reserved for tasks' fault-tolerant operation, has high rejection rate and low resource utilization. This paper presents fault-tolerant rate-monotonic scheduling with resource reclaim, based on FT-RM, to improve resource utilization and tasks throughoutput. This algorithm makes use of the attribute that the actual execution time of task is shorter than the worst execution time, to reclaim and reuse the resource released by the ended task. At last, the performance simulation and analysis of the scheduling algorithm are presented and factors that affect performance are investigated.