Fault-tolerant earliest deadline first scheduling with resource reclaim
Yu Chen, Xun Yu, Guangze Xiong · 2003
A fault-tolerant real-time scheduling algorithm through time redundancy, with a schedulability bound, is based on the worst execution time of tasks and the time reserved for fault-tolerant operation of tasks, has a high rejection rate and low resource utilization. This paper presents fault-tolerant earliest deadline scheduling with resource reclaim, based on FT-EDF, to improve resource utilization and task throughput. This algorithm makes use of the fact 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.