Steady-State for Batches of Identical Task Graphs

In this paper, we focus on the problem of scheduling batches of identi- cal task graphs on a heterogeneous platform, when the task graph consists in a tree. We rely on steady-state scheduling, and aim at reaching the op- timal throughput of the system. Contrarily to previous studies, we con- centrate upon the scheduling of batches of limited size. We try to reduce the processing time of each instance, thus making steady-state scheduling applicable to smaller batches. The problem is proven NP-complete, and a mixed integer program is presented to solve it. Then, dierent solutions, using steady-state scheduling or not, are evaluated through comprehensive simulations.