针对约束复杂性的特点，论文对强实时任务的可调度性分析方法进行了扩展和补充。
Since the constraints of tasks are complicated, this thesis extends and complements the schedulability analysis methods for hard real-time tasks.
提出一种基于实时统一建模语言对实时系统可调度性进行分析的方法。
One method for real-time system schedulability analysis is presented based on real-time unified modeling language.
基于对业务活动的可调度性分析，提出了时序一致性验证方法，确保工作流执行中活动之间时间交互的安全性。
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.
目前现有的基于周期性任务模型的确定性分析方法比较保守，不适合于多媒体、通讯等软实时系统的可调度性分析。
The existing deterministic analysis methods based on period task modes are conservative, and are not suitable for soft real time systems such as multimedia systems and communication systems.
理论分析与仿真测试结果都表明，这两种协议能够改善硬实时事务集的可调度性，并实现更高的处理器利用率。
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.
分析了强实时任务实例优先级提升时间和任务集的可调度性。
Finally, the priority promotion time of the hard real-time task and the schedulability are investigated.
最坏执行时间分析与可调度性分析构成了实时系统时间方面操作可信的基础。
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.
实时任务可调度分析是保证实时系统正确性的重要手段之一。
Real time task schedulability analysis is one of the major methods used to provide performance guarantee to real time systems.
基于抢占阈值调度的任务响应时间分析方法是一种新型实时系统任务可调度性判定技术。
The response time analysis method for scheduling tasks with preemption threshold is a novel schedulability technology .
在分析非周期实时任务可调度性的基础上，提出一种基于处理器瞬态利用率、系统安全风险最小的在线调度近似算法。
Based on the concept of synthetic utilization of aperiodic tasks, an online task scheduling algorithm is designed to schedule security-sensitive aperiodic tasks with minimal security risk.
分析了信息的可调度性，给出了信息可调度性的判断条件。
The schedulability of messages is investigated and schedulable condition is given.
分析了该算法的可调度性条件。
分析得出了任务受到最高优先级任务干涉的最大可能值，由此得到了一个更紧的可调度性判断条件。
The possible maximum interference of the tasks with highest priority was given by analysis, and then a tighter schedulability policy was put forward.
并分析了该算法的可调度性条件。
分析了算法的可调度性，给出任务的可调度性条件。
The schedulability of the algorithm is analyzed and the schedulable condition is given.
论文还提出了LRIF调度算法的可调度性分析方法，并讨论了LRIF调度算法的实现方法。
The schedulability test approach for LRIF algorithm is presented. The implementation issues of LR...
论文还提出了LRIF调度算法的可调度性分析方法，并讨论了LRIF调度算法的实现方法。
The schedulability test approach for LRIF algorithm is presented. The implementation issues of LR...
应用推荐