A New Real-Time Scheduling Algorithm
Shu‐Ju Wang · Computer Technology and Development · 2010
In embedded operation system,system's performance largely depends on the scheduling strategy.The research on how to improve the system's performance to satisfy the real-time requirement has become a hotspot in this area.For the traditional first come first server(FCFS) scheduling algorithm determines priority only by the length of waiting-time but ignores the endurance of the job's waiting-time,and rate monotonic(RM) algorithm just measure jobs' priority by the length of jobs'life cycle but makes those who have a long life period and urgently needed to be executed can't be scheduled,aiming at those,a new method of setting priorities dynamically-the rest time algorithm is proposed in this paper.This algorithm determines priority by jobs'waiting-time and life cycle together.Through analysis and experiments see that this method possesses the advantage of both RM and FCFS.In this method,tasks are given priority not only according to the length of life-cycle,but also considering the task's waiting-time.Experimental results show that it can largely improve the real-time task's completion rate and CPU's utilization.