Scalable duplication strategy with bounded availability of processors

In this paper we present a task selection scheme and a list-scheduling algorithm for scheduling DAGs onto homogeneous/heterogeneous systems with bounded availability of processors. Specifically, forbidden duplications and superfluous duplications are eliminated in the task selection phase and the processor selection phase respectively. Simulation results show that the proposed algorithm outperforms other high performance algorithms when the availability of processors is restrained.