基于有限优先级的动态调度分组算法

实时调度是实时系统中的关键问题,实时动态调度是实时调度的主要方面.实时调度在理论分析时,都假设系统能识别任意多的优先级.当实时调度应用于实际的任务系统时,仅能使用有限的优先级数量.在实际的任务系统中进行动态调度分析时包含任务系统动态调度所需的最小优先级数量的判断方法和任务系统分组算法.在此基础上,给出了任务系统分组的算法及最优分组的判定条件,并详细说明了任务系统分组算法的步骤和过程.

Dynamic Scheduling Grouping Algorithm Based on Limited Priority Levels

Real-time scheduling is a key in real-time system,and real-time dynamic scheduling is the main part in real-time scheduling.When carry out theoretic analysis of real-time scheduling,real-time theory assume that system owns enough number of priority levels.But in practical tasks,system only limited priority levels could be used.In practical tasks system,analysis for dynamic scheduling included two continuous parts: judged method that tasks systems require minimum number of priority levels for dynamic scheduling and grouping algorithm for tasks system.On the basis of previous result,the paper presented grouping algorithm for tasks system and judged condition for best grouping.The steps and the process for the algorithm are described in detail.