A scheduling algorithm for an out-tree DAG

An effective scheduling algorithm is key to achieving high performance. This paper presents an algorithm based on task duplication to schedule an out-tree task graph which represents a number of divide-and-conquer algorithms. The scheduling algorithm has the shortest possible scheduling length and economizes the processors with O(|e|/spl middot/|/spl nu/|/sup 2/) complexity. Moreover, it also outperforms the CPFD (critical-path fast duplication) and TDS (task duplication-based scheduling) algorithms.