Fault-Tolerant Earliest Deadline First Scheduling with Resource Reclaimation
Yu Chen · Systems engineering and electronics · 2003
Fault-tolerant real-time scheduling algorithm based on the time redundancy, whose schedulability bound is based on the worst execution time of tasks and the time reserved for tasks' fault-tolerant operation, has a high rejection rate and low resource utilization. In this paper the fault-tolerant earliest deadline first scheduling with resource reclaim ation is presented, on the basis of FT-EDF, to improve resource utilization and task′s throughput. This algorithm makes use of the characteristic that the actual execution time of the task is lower than the worst execution time, to reclaim and reuse the resource released by the completed task.