Task clustering and scheduling to multiprocessors with duplication

Optimal task-duplication-based scheduling of tasks represented by a directed acyclic graph (DAG) onto a set of homogenous distributed memory processors, is a strong NP-hard problem. In this paper we present a clustering and scheduling algorithm with time complexity O(v³logv), where v is the number of nodes, which is able to generate an optimal schedule for some specific DAG. For arbitrary DAG, the schedule generated is at most two times as the optimal one. Simulation results show that the performance of TCSD is superb compared to those of four renowned algorithms: PY TDS, TCS and CPFD.