固定优先级任务可调度性判定是实时系统调度理论研究的核心问题之一。
One of the key issues in real-time theory is the schedulable analysis of a given task set with fixed priority.
在单调速率调度策略的基础上，提出一种改进的任务集可调度性判定算法。
This paper present an improved method for analyzing the schedulability of periodic task sets under Rate Monotonic(RM) priority assignment.
基于抢占阈值调度的任务响应时间分析方法是一种新型实时系统任务可调度性判定技术。
The response time analysis method for scheduling tasks with preemption threshold is a novel schedulability technology .
文中给出该算法的可调度判定不等式，并且通过对经典任务集的调度结果，验证了算法的有效性和灵活性。
Schedulability test inequation of the algorithm is presented in the paper. The validity and the flexibility of the algorithm are proved through the analysis of classical task sets.
文中给出该算法的可调度判定不等式，并且通过对经典任务集的调度结果，验证了算法的有效性和灵活性。
Schedulability test inequation of the algorithm is presented in the paper. The validity and the flexibility of the algorithm are proved through the analysis of classical task sets.
应用推荐