Least Slack First Schedule Algorithm Based on Dynamic Preemption Threshold
Zhao Gong-yi · Jisuanji gongcheng · 2012
In Least Slack First(LSF) schedule algorithm,when there are multiple tasks which have the same or similar task priority,too much context switch resulting bump phenomenon that will greatly increase the system overhead.Based on preemption threshold,combined with the characteristics of LSF algorithm,through the rational design of dynamic preemption threshold,this paper proposes an improved algorithm named DPTLSF.Simulation results show that the improved algorithm can effectively reduce the bumps from occurring and reduce the missed deadline percentage of task set.