Sciweavers

Share
PDP
2005
IEEE

Independent and Divisible Tasks Scheduling on Heterogeneous Star-shaped Platforms with Limited Memory

12 years 7 months ago
Independent and Divisible Tasks Scheduling on Heterogeneous Star-shaped Platforms with Limited Memory
In this paper, we consider the problem of allocating and scheduling a collection of independent, equal-sized tasks on heterogeneous star-shaped platforms. We also address the same problem for divisible tasks. For both cases, we take memory constraints into account. We prove strong NP-completeness results for different objective functions, namely makespan minimization and throughput maximization, on simple star-shaped platforms. We propose an approximation algorithm based on the unconstrained version (with unlimited memory) of the problem. We introduce several heuristics, which are evaluated and compared through extensive simulations. An unexpected conclusion drawn from these experiments is that classical scheduling heuristics that try to greedily minimize the completion time of each task are outperformed by the simple heuristic that consists in assigning the task to the available processor that has the smallest communication time, regardless of computation power (hence a "bandwid...
Olivier Beaumont, Arnaud Legrand, Loris Marchal, Y
Added 25 Jun 2010
Updated 25 Jun 2010
Type Conference
Year 2005
Where PDP
Authors Olivier Beaumont, Arnaud Legrand, Loris Marchal, Yves Robert
Comments (0)
books