Energy Efficient Scheduling of MapReduce Jobs

MapReduce has emerged as a prominent programming model for data-intensive computation. In this work, we study power-aware MapReduce scheduling in the speed scaling setting first introduced by Yao et al. [FOCS 1995]. We focus on the minimization of the total weighted completion time of a set of MapRe...

Full description

Saved in:
Bibliographic Details
Published inEuro-Par 2014 Parallel Processing pp. 198 - 209
Main Authors Bampis, Evripidis, Chau, Vincent, Letsios, Dimitrios, Lucarelli, Giorgio, Milis, Ioannis, Zois, Georgios
Format Book Chapter
LanguageEnglish
Published Cham Springer International Publishing 01.01.2014
SeriesLecture Notes in Computer Science
Subjects
Completion Time
Feasible Schedule
Linear Programming Relaxation
Precedence Constraint
Total Weighted Completion Time
Online AccessGet full text
ISBN3319098721
9783319098722
ISSN0302-9743
1611-3349
DOI10.1007/978-3-319-09873-9_17

Cover

More Information
Summary:MapReduce has emerged as a prominent programming model for data-intensive computation. In this work, we study power-aware MapReduce scheduling in the speed scaling setting first introduced by Yao et al. [FOCS 1995]. 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 derive a polynomial time constant-factor approximation algorithm. We also propose a convex programming formulation that we combine with standard list scheduling policies, and we evaluate their performance using simulations.
Bibliography:This work was partially supported by the European Union (European Social Fund - ESF) and Greek national funds, through the Operational Program ”Education and Lifelong Learning”, under the programs THALES-ALGONOW (E. Bampis, G. Lucarelli, I. Milis) and HERACLEITUS II (G. Zois), and the project “Mathematical Programming and Non-linear Combinatorial Optimization” under the program PGMO (E. Bampis, V. Chau, G. Lucarelli).
ISBN:3319098721
9783319098722
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-319-09873-9_17