Research and improvement of rate-monotonic scheduling algorithm

The rate-monotonic scheduling algorithm is a static scheduling algorithm for periodic tasks, but the classic rate-monotonic scheduling algorithm only determines the task´s priority by its period, the deadline of long period and important tasks can not be guaranteed. Here, a new static scheduling algorithm called DPSS. The integrated priority tasks obtained by calculating the two parameters-running time and importance, and at last the integrated priority will be classified by grouping. Through theoretical analysis and experimental results analysis, the method reduces the task deadline missing ratio, and could be more effective in real-time task scheduling.