An effective scheduling algorithm is a key to achieve high performance, this paper presents an algorithm based on task duplication to schedule on Out-Tree task graph which represent a number of divide-and-coquer algorithms. The scheduling algorithm of this paper has the shortest scheduling length, and economizes the processors with O(|e||v|~2) complexity. Moreover it also outperforms CPFD and TDS algorithms purposed within two years.
展开▼
机译：有效的调度算法是实现高性能的关键，本文提出了一种基于任务复制的Out-Tree任务图调度算法，该算法代表了许多分而治之的算法。本文的调度算法具有最短的调度长度，并且节省了O（| e || v |〜2）复杂度的处理器。此外，它在两年内还超越了CPFD和TDS算法。
展开▼
