给出针对普通任务图带通信限制的基于复制调度算法TDMSCL。
Proposed a duplication based task scheduling algorithm with communication limits for general task graph, TDMSCL.
本文专门针对该类任务图，提出了一个新的调度算法。
This paper proposes a new algorithm for scheduling an Out-Tree task graph.
针对连接图的这一特点，改进传统的搜索算法，使之可以针对调度任务自动计算操作步骤。
The traditional search algorithm has been improved based on the features of connected graph so that it can calculate operation steps of any specific scheduled task automatically.
应用推荐