Scheduling with Duplication on m Processors with Small Communication Delays

We consider the problem of scheduling a directed acyclic graph on a limited number of processors in presence of communication delays (P∣prec, Cij∣Cmax). Under the small communication time assumption, meaning that the communication delays are smaller than the computation times of the tasks, we propose a new list scheduling algorithm. This algorithm takes advantage of the duplication to reduce the impact of the communications on the schedule makespan. We establish for this algorithm a worst case performance guarantee of 2 compared to an optimal solution.