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 tasks 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 realtime task scheduling.
Rate-monotonic scheduling algorithm Static scheduling Integrated priority Classify by grouping Real-time task scheduling
Xueqiao Li Shuang Liang Yuan Chen
School of Computer and Communication Engineering, Zhengzhou University of Light Industry, Zheng Zhou 450000, China
国际会议
长春
英文
66-69
2010-08-24(万方平台首次上网日期,不代表论文的发表时间)