Fault-Tolerant Earliest-Deadline-First Scheduling Algorithm

Hakem Beitollahi, Seyed Ghassem Miremadi, Geert Deconinck
2007 2007 IEEE International Parallel and Distributed Processing Symposium  
The general approach to fault tolerance in uniprocessor systems is to maintain enough time redundancy in the schedule so that any task instance can be re-executed in presence of faults during the execution. In this paper a scheme is presented to add enough and efficient time redundancy to the Earliest-Deadline-First (EDF) scheduling policy for periodic real-time tasks. This scheme can be used to tolerate transient faults during the execution of tasks. We describe a recovery scheme which can be
more » ... cheme which can be used to re-execute tasks in the event of transient faults and discuss conditions that must be met by any such recovery scheme. For performance evaluation of this idea a tool is developed.
doi:10.1109/ipdps.2007.370608 dblp:conf/ipps/BeitollahiMD07 fatcat:wakhi26lcvciboor2dgclxbuwq