An Improved Least-Laxity-First Scheduling Algorithm for Periodic Tasks
Xiufen Fu · Journal of Jiangxi Normal University · 2006
The LLF(Least Laxity First) scheduling algorithm assigns a priority to a task according to its executing urgency.The smaller the laxity value of a task is,the sooner it needs to be executed.However it leads to switch frequently among tasks,which causes the overhead of a system and restricts its application.In order to get appropriate scheduling time slice,many experts have been researching how to improve LLF scheduling algorithm.Based on studying feature for periodic tasks carefully,we proposed the least switch and laxity first scheduling algorithm in the paper,which improves LLF algorithm for periodic tasks by searching out an appropriate time slice.Emulation experiments showed this algorithm is valid.