Design and Simulation of Preemption Threshold Scheduling Algorithm with Software Fault-Tolerance
Guo Feng-zhao · Jisuanji fangzhen · 2012
Based on software fault-tolerant model,a new scheduling algorithm called fault-tolerant fixed-priority with preemption threshold(FT-FPPT) was proposed in order to improve system fault resilience and reduce the preemptions.Furthermore,an optimal preemption threshold configuration search algorithm(PTCSA),which uses some properties of the schedulability analysis,was proposed.It is shown that the method used to find out an appropriate preemption threshold configuration reduces the search space from to,where is the number of tasks.At length,it is proved that PTCSA is optimal.Simulation experiment shows that FT-FPPT can be used to effectively enhance the fault-tolerant capability when traditional fixed-priority preemptive fault-tolerant scheduling algorithm may no longer be appropriate.