论文部分内容阅读
本文用动态位级函数的概念来量化各调度步的诸多信息以及任务被调度的优先级别,将其总结为最大动态位级函数优先调度策略,并构造出相应的调度算法.在实时调度中,该算法能很快地产生一个满意解甚至最优解.本文还给出了在偏序任务图中具有瓶颈节点情况下的改进型算法.
In this paper, the concept of dynamic bit-level function is used to quantify the information of each scheduling step and the priority of task scheduling, which is summarized as the priority scheduling strategy of the maximum dynamic level function and the corresponding scheduling algorithm is constructed.In the real-time scheduling, The algorithm can quickly produce a satisfactory solution or even an optimal solution.In this paper, an improved algorithm with bottleneck nodes in the partial order task graph is also given.