Download now Free registration required
Some task scheduling algorithms generate the shortest schedule, when its input DAG satisfies a specified condition. Among those scheduling algorithms, TDS algorithm proposed a DAG condition where allocation of two parent tasks of a join task in the same processor cause longer schedule length than allocation in different processors, and it generates the shortest schedule if any input DAG satisfies the condition. In the paper, the authors propose a post-processing scheduling algorithm that reduces the number of processors while preserving its schedule length.
- Format: PDF
- Size: 411.2 KB