提出了一种实时系统任务模型，分析了该模型中周期和非周期任务可调度的条件，并给出了一种强实时非周期任务的可预测调度算法。
This paper presents a task model for real time systems and gives the conditions that guarantee periodic and aperiodic tasks to be schedulable respectively.
分析了信息的可调度性，给出了信息可调度性的判断条件。
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 schedulability of task set is analyzed and the method of calculating the minimal number of processor 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.
分析了该算法的可调度性条件。
并分析了该算法的可调度性条件。
并分析了该算法的可调度性条件。
应用推荐