Since the constraints of tasks are complicated, this thesis extends and complements the schedulability analysis methods for hard real-time tasks.
针对约束复杂性的特点，论文对强实时任务的可调度性分析方法进行了扩展和补充。
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.
理论分析与仿真测试结果都表明，这两种协议能够改善硬实时事务集的可调度性，并实现更高的处理器利用率。
One method for real-time system schedulability analysis is presented based on real-time unified modeling language.
提出一种基于实时统一建模语言对实时系统可调度性进行分析的方法。
应用推荐