Improvement of rate-monotonic scheduling algorithm
Yuan Chen · Journal of Zhengzhou University of Light Industry · 2010
Aiming at the problem of the classic static scheduling algorithm that only determines the task's priority by its period,and can not guarantee the deadline of long period and important tasks.Here,a new rate-monotonic scheduling algorithm called CPSS was put forward.The integrated priority is obtained by calculating the two parameters-running—tasks' time and importance,and at last is classified by grouping based on this algorithm.Theoretical analysis and experimental results showed that the method reduces the task deadline missing ratio,and could be more effective in real-time task scheduling.