摘要： 在单调速率调度策略的基础上，提出一种改进的任务集可调度性判定算法。该算法通过设定时钟变量模拟调度过程中的系统时钟，在时钟变量值增长过程中，根据任务优先级从高到低的顺序，分析各个任务的截止时间限的满足情况，判定任务的可调度性，从而确定任务集的可调度性。通过实例分析及与现有判定方法的比较，验证了该算法的正确性和高效性。

关键词: 实时调度, 单调速率, 任务集, 可调度性判定, 时钟变量

Abstract: This paper present an improved method for analyzing the schedulability of periodic task sets under Rate Monotonic(RM) priority assignment. This algorithm simulates the system clock in the process of scheduling by setting clock variable, in the process of this clock variable growth, according to the task priority from high to low sequence, which analyzes each task deadline constraint, judge the single task schedulability, thus determine whole task set scenario. At the end, an instance analysis and comparison with existing methods verify the accuracy and efficiency.

Key words: real-time schedule, Rate Monotonic(RM), task set, schedulability test, clock variable

中图分类号: 

• TP311