Skip to Main content Skip to Navigation

On the Complexity of Multi-Round Divisible Load Scheduling

Abstract : In this paper we study master-worker scheduling of divisible loads in heterogeneous distributed systems. Divisible loads are computations that can be arbitrarily divided into independent ``chunks'', which can then be processed in parallel. In multi-round scheduling load is sent to each worker as several chunks rather than as a single one. Solving the divisible load scheduling (DLS) problem entails determining the subset of workers that should be used, the sequence of communication to these workers, and the sizes of each load chunk. We first state and establish an optimality principle in the general case. Then we establish a new complexity result by showing that a DLS problem, whose complexity has been open for a long time, is in fact NP-hard, even in the one-round case. We also show that this problem is pseudopolynomially solvable under certain special conditions. Finally, we present a deep survey on algorithms and heuristics for solving the multi-round DLS problem.
Complete list of metadata
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Thursday, January 11, 2007 - 1:31:10 PM
Last modification on : Friday, January 21, 2022 - 3:23:40 AM
Long-term archiving on: : Tuesday, September 21, 2010 - 11:56:21 AM


Files produced by the author(s)


  • HAL Id : inria-00123711, version 2



Yang Yang, Henri Casanova, Maciej Drozdowski, Marcin Lawenda, Arnaud Legrand. On the Complexity of Multi-Round Divisible Load Scheduling. [Research Report] RR-6096, INRIA. 2007, pp.23. ⟨inria-00123711v2⟩



Les métriques sont temporairement indisponibles