Resource-aware allocation strategies for divisible loads on large-scale systems

In this paper, we deal with the large-scale divisible load problem studied in [12]. We show how to reduce this problem to a classical preemptive scheduling problem on a single machine, thereby establishing new complexity results, and providing new approximation algorithms and heuristics that subsume those presented in [12]. We also give some hints on how to extend the results to a more realistic framework where communication costs are taken into account.

• Type: Conference
• Year: 2009
• Where: IPPS
• Authors: Anne Benoit, Loris Marchal, Jean-Francois Pineau, Yves Robert, Frédéric Vivien
• Keywords: Distributed And Parallel Computing, Divisible Load Problem, IPPS 2009, Preemptive Scheduling Problem, Realistic Framework