容错最早时限优先调度

Fault-Tolerant Earliest Deadline First Scheduling

最早时限优先调度 ( EDF)是最优的动态可抢占优先级实时调度算法 ,具有灵活、简单和高效的特点 ,但并没有考虑实时系统的容错要求。本文提出一种容错 EDF算法 ,实现在规定时间段内的单个错误容错。本文详细分析了该算法的容错机制 ,证明了该算法的正确性 。

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