Fault-Tolerant Earliest Deadline First Scheduling
Xiong Guang-ze · Computer Engineering and Science · 2001
Earliest deadline first scheduling (EDF) is an optimal dynamic preempt ive scheduling algorithm It is flexible, simple and efficient,but does not su pport fault tolerance In this paper, we presents a new fault-toler ant EDF to tolerate the single fault in a specified interval We analyses the mecha n ism of the algorithm, proves its validity and gives its schedulability condition s