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

Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01185803
Contributor : Lip6 Publications <>
Submitted on : Friday, August 21, 2015 - 3:24:19 PM
Last modification on : Tuesday, November 19, 2019 - 9:30:26 AM

Identifiers

Citation

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

Share

Metrics

Record views

170