单调速率调度算法的改进  

Improvement of rate-monotonic scheduling algorithm

作　　者：李学桥[1] 梁爽[1] 陈园[1] 

机构地区：[1]郑州轻工业学院计算机与通信工程学院,河南郑州450002

出　　处：《郑州轻工业学院学报（自然科学版）》2010年第6期29-32,共4页Journal of Zhengzhou University of Light Industry:Natural Science

摘　　要：针对经典的静态调度算法RM仅以任务的周期来决定优先级,容易导致某些周期较长且非常重要的任务错过截止期而无法调度的问题,提出一种新的静态调度算法——基于单调速率调度算法的改进算法(CPSS).该算法利用任务的运行时间和重要程度2个参数计算得出任务的综合优先级,并将综合优先级通过分组的方式进行分类.理论分析和实验结果表明,该算法降低了任务的截止期错失率,可以更有效地调度实时任务.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.

关 键 词：单调速率调度算法 静态调度 综合优先级 分组方式 实时任务调度 

分 类 号：TP316.2[自动化与计算机技术—计算机软件与理论]