Minimizing the volume in scheduling an outtree with communication delays and duplication - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Parallel Computing Année : 2002

Minimizing the volume in scheduling an outtree with communication delays and duplication

Résumé

We consider in this paper a scheduling problem with small communication delays and an unbounded number of processors. It is known that duplication can improve the makespan of schedules. However, scheduling algorithms may create a huge amount of duplicates. The volume of a schedule is defined as the total number of tasks (i.e., original and duplicates). Assuming that the tasks have the same processing time d, that communication delays are all equal to c⩽d and that the precedence graph is an out-tree, we study the problem of finding the minimum volume of a feasible schedule with makespan t. We derive some dominance properties and prove that this problem is polynomial using a dynamic programming algorithm.

Dates et versions

hal-01185803 , version 1 (21-08-2015)

Identifiants

Citer

Claire Hanen, Alix Munier-Kordon. Minimizing the volume in scheduling an outtree with communication delays and duplication. Parallel Computing, 2002, 28 (11), pp.1573-1585. ⟨10.1016/S0167-8191(02)00131-X⟩. ⟨hal-01185803⟩
106 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More