Preemptive Behavior Analysis and Improvement of Priority Scheduling Algorithms

Most of embedded real-time systems only deploy necessary resources so that the extra preemption overheads among tasks debase the system performance terribly. Through scheduling process analysis of periodic task, this paper presents the waiting limit formula of each task in ready queue while guarantees its deadline. In addition, some properties such as final preempt time is deduced and the necessary condition of preemptive behavior of periodic tasks is quantitatively described. Based on them, a micro scheduling preempt model for periodic tasks in ready queue is put forward, which decreases preempt amount and optimizes system performance through change preempt relationship. The model cannot only decreases preempt amount effectively but enhances processor utilization for static priority scheduling algorithm such as rate monotonic scheduling, which is demonstrated by case study and simulation.