给出针对普通任务图带通信限制的基于复制调度算法TDMSCL。

Proposed a duplication based task scheduling algorithm with communication limits for general task graph, TDMSCL.

youdao

本文专门针对该类任务图，提出了一个新的调度算法。

This paper proposes a new algorithm for scheduling an Out-Tree task graph.

youdao

针对连接图的这一特点，改进传统的搜索算法，使之可以针对调度任务自动计算操作步骤。

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.

youdao

该算法可以实现子任务集在DAG图限制下的最优调度。

Optimal scheduling can be realized in the restriction of DAG in this algorithm.

youdao

文章首先介绍了负载分配的几种分类，然后重点讨论了基于任务相关图的静态任务调度，最后给出了几种其它的任务调度模型。

This paper first gives several classifications of load assignation, and then lays emphasis on the scheduling based on interactive graph of tasks. At last other scheduling models are introduced simply.

youdao

文章首先介绍了负载分配的几种分类，然后重点讨论了基于任务相关图的静态任务调度，最后给出了几种其它的任务调度模型。

This paper first gives several classifications of load assignation, and then lays emphasis on the scheduling based on interactive graph of tasks. At last other scheduling models are introduced simply.

youdao