The schedulability of the algorithm was analyzed.
并分析了该算法的可调度性条件。
The schedulability of the algorithm is also analyzed.
分析了该算法的可调度性条件。
The schedulability of messages is investigated and schedulable condition is given.
分析了信息的可调度性，给出了信息可调度性的判断条件。
The schedulability of the algorithm is analyzed and the schedulable condition is given.
分析了算法的可调度性，给出任务的可调度性条件。
The thesis analyses RealTime System in two aspects: General Resource Model and Schedulability Model.
文章从两方面对实时系统进行分析：总体资源模型和调度模型。
The schedulability test approach for LRIF algorithm is presented. The implementation issues of LR...
论文还提出了LRIF调度算法的可调度性分析方法，并讨论了LRIF调度算法的实现方法。
The experimental results show that the proposed schedulability policy increases the amount of detected task set.
实验结果表明，提出的方法提高了判为可调度的任务集数量。
One method for real-time system schedulability analysis is presented based on real-time unified modeling language.
提出一种基于实时统一建模语言对实时系统可调度性进行分析的方法。
The schedulability of task set is analyzed and the method of calculating the minimal number of processor is given.
给出了该调度算法的任务集可调度的充分条件、任务集可调度所需最小处理器个数的计算方法。
The response time analysis method for scheduling tasks with preemption threshold is a novel schedulability technology .
基于抢占阈值调度的任务响应时间分析方法是一种新型实时系统任务可调度性判定技术。
They form the inputs for schedulability tools, which test whether a given task set is schedulable on a given target system.
最坏执行时间是可调度分析工具的输入，可调度分析决定了一组任务在一个给定的目标系统下是否可调度。
Real time task schedulability analysis is one of the major methods used to provide performance guarantee to real time systems.
实时任务可调度分析是保证实时系统正确性的重要手段之一。
UDB improves the schedulability of task sets by reducing the interference from the higher priority tasks to the lower priority tasks.
通过降低高优先级任务对低优先级任务的干扰时间，UDB提高了任务集的可调度性。
This paper present an improved method for analyzing the schedulability of periodic task sets under Rate Monotonic(RM) priority assignment.
在单调速率调度策略的基础上，提出一种改进的任务集可调度性判定算法。
Use the annotations for schedulability analysis to predict whether the design will meet timing constraints and to validate correctness of the timing.
使用schedulability分析的注解，来指定设计是否满足时间限制并验证时间的正确性。
The proposed algorithm is in centralized manner, and improves the schedulability of tasks by introducing a new efficient task assignment policy.
该算法采用了集中式的调度方案，同时，引入了一个新的任务分配策略，从而通过提高任务可行性而提高了算法的调度成功率。
Since the constraints of tasks are complicated, this thesis extends and complements the schedulability analysis methods for hard real-time tasks.
针对约束复杂性的特点，论文对强实时任务的可调度性分析方法进行了扩展和补充。
The possible maximum interference of the tasks with highest priority was given by analysis, and then a tighter schedulability policy was put forward.
分析得出了任务受到最高优先级任务干涉的最大可能值，由此得到了一个更紧的可调度性判断条件。
The paper also analyzes the task schedulability when RMS scheduling algorithm is adopted, and an algorithm for acquiring response time of task is given.
分析了调度算法任务下的调度性，给出了求任务RMS响应时间的算法。
By using them, the sampling frequencies of periodic tasks are optimized under maintained schedulability and the control delay of periodic task is reduced.
它们在保证任务可调度的前提下，对周期性任务的采样频率和控制延时进行优化。
This paper presents an optimal realization model based on the preemption threshold for real-time multitask systems, which has low overheads and higher schedulability.
论文提出了一种基于抢占门限的实时多任务系统的优化实现模型，它同时具有低开销与高可调度性。
The necessary and sufficient conditions are given for the schedulability of real time connections at each network node under preemptive earliest due date scheduling policy.
在抢先最早预定日期调度策略下，给出了任意网络结点上实时连接调度能力的充分必要条件。
Both theoretic analysis and simulation test show that, these two protocols can improve the schedulability of hard real-time transactions, and achieve higher processor utilization.
理论分析与仿真测试结果都表明，这两种协议能够改善硬实时事务集的可调度性，并实现更高的处理器利用率。
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.
文中给出该算法的可调度判定不等式，并且通过对经典任务集的调度结果，验证了算法的有效性和灵活性。
Together with schedulability analysis, Worst-Case Execution Time analysis(WCET analysis) forms the basis for establishing confidence into the timely operation of a real-time system.
最坏执行时间分析与可调度性分析构成了实时系统时间方面操作可信的基础。
Based on analyzing the schedulability of business activities, a time consistency verification method is put forward to assure safe time interactions between activities during workflow executions.
基于对业务活动的可调度性分析，提出了时序一致性验证方法，确保工作流执行中活动之间时间交互的安全性。
Based on analyzing the schedulability of business activities, a time consistency verification method is put forward to assure safe time interactions between activities during workflow executions.
基于对业务活动的可调度性分析，提出了时序一致性验证方法，确保工作流执行中活动之间时间交互的安全性。
应用推荐