Energy Efficient Scheduling of MapReduce Jobs
Evripidis Bampis Vincent Chau Dimitrios Letsios Giorgio Lucarelli Ioannis Milis and Georgios Zois
We focus on the minimization of the total weighted completion time of a set of MapReduce jobs under a given budget of energy. Using a linear programming relaxation of our problem, we de-rive a polynomial time constant-factor approximation algorithm. We also propose a convex programming formulation that we combine with stan-dard list scheduling policies, and we evaluate their performance using simulations.