Energy Aware Scheduling for Weighted Completion Time and Weighted Tardiness

The ever increasing adoption of mobile devices with limited energy storage capacity, on the one hand, and more awareness of the environmental impact of massive data centres and server pools, on the other hand, have both led to an increased interest in energy management algorithms. The main contribution of this paper is to present several new constant factor approximation algorithms for energy aware scheduling problems where the objective is to minimize weighted completion time plus the cost of the energy consumed, in the one machine non-preemptive setting, while allowing release dates and deadlines.Unlike previous known algorithms these new algorithms can handle general job-dependent energy cost functions, extending the application of these algorithms to settings outside the typical CPU-energy one. These new settings include problems where in addition, or instead, of energy costs we also have maintenance costs, wear and tear, replacement costs, etc., which in general depend on the speed at which the machine runs but also depend on the types of jobs processed. Our algorithms also extend to approximating weighted tardiness plus energy cost, an inherently more difficult problem that has not been addressed in the literature.

[1]  R. G. Vickson,et al.  Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine , 1980, Oper. Res..

[2]  Dvir Shabtay,et al.  Minimizing the total weighted flow time in a single machine with controllable processing times , 2004, Comput. Oper. Res..

[3]  Kirk Pruhs,et al.  Speed scaling to manage energy and temperature , 2007, JACM.

[4]  Martin Skutella,et al.  List Scheduling in Order of α-Points on a Single Machine , 2006, Efficient Approximation and Online Algorithms.

[5]  Kirk Pruhs,et al.  Speed Scaling to Manage Temperature , 2005, STACS.

[6]  Adam Janiak,et al.  Single machine scheduling subject to deadlines and resource dependent processing times , 1996 .

[7]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[8]  David B. Shmoys,et al.  Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms , 1997, Math. Oper. Res..

[9]  Kirk Pruhs,et al.  Speed Scaling to Manage Temperature , 2005, STACS.

[10]  Nikhil Bansal,et al.  Scheduling for Speed Bounded Processors , 2008, ICALP.

[11]  Rakesh K. Sarin,et al.  Technical Note - Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy , 1989, Oper. Res..

[12]  Ji-Bo Wang,et al.  Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time , 2012, Comput. Oper. Res..

[13]  A. Wierman,et al.  Optimality, fairness, and robustness in speed scaling designs , 2010, SIGMETRICS '10.

[14]  Sandy Irani,et al.  Algorithmic problems in power management , 2005, SIGA.

[15]  K. R. Baker,et al.  A bicriterion approach to time/cost trade-offs in sequencing , 1982 .

[16]  Wojciech Jawor,et al.  Three dozen papers on online algorithms , 2005, SIGA.

[17]  Murali S. Kodialam,et al.  Scheduling in mapreduce-like systems for fast completion time , 2011, 2011 Proceedings IEEE INFOCOM.

[18]  Martin Skutella,et al.  Single Machine Scheduling with Release Dates , 2002, SIAM J. Discret. Math..

[19]  Cynthia A. Phillips,et al.  Minimizing average completion time in the presence of release dates , 1998, Math. Program..

[20]  Kirk Pruhs,et al.  Average Rate Speed Scaling , 2008, Algorithmica.

[21]  David B. Shmoys,et al.  Scheduling to minimize average completion time: off-line and on-line algorithms , 1996, SODA '96.

[22]  Adam R. H. Stevens,et al.  How to get cool in the heat : comparing analytic models of hot, cold, and cooling gas in haloes and galaxies with EAGLE. , 2016, 1608.04389.

[23]  Dvir Shabtay,et al.  A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates , 2011, J. Sched..

[24]  Kirk Pruhs,et al.  Dynamic speed scaling to manage energy and temperature , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[25]  Susanne Albers,et al.  Energy-efficient algorithms , 2010, Commun. ACM.

[26]  Dvir Shabtay,et al.  A survey of scheduling with controllable processing times , 2007, Discret. Appl. Math..

[27]  Michel X. Goemans,et al.  Improved approximation algorthims for scheduling with release dates , 1997, SODA '97.

[28]  Willy Herroelen,et al.  Project scheduling under uncertainty: Survey and research potentials , 2005, Eur. J. Oper. Res..

[29]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[30]  T. C. Edwin Cheng,et al.  Bicriterion Single Machine Scheduling with Resource Dependent Processing Times , 1998, SIAM J. Optim..

[31]  Kirk Pruhs,et al.  Non-Preemptive Min-Sum Scheduling with Resource Augmentation , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[32]  Zuren Feng,et al.  Single machine scheduling with total tardiness criterion and convex controllable processing times , 2011, Ann. Oper. Res..

[33]  Richard L. Daniels,et al.  A multi-objective approach to resource allocation in single machine scheduling , 1990 .

[34]  Susanne Albers,et al.  Energy-efficient algorithms for flow time minimization , 2006, STACS.

[35]  Adam Janiak,et al.  One-machine scheduling with allocation of continuously-divisible resource and with no precedence constraints , 1987, Kybernetika.

[36]  Susanne Albers,et al.  Algorithms for Energy Saving , 2009, Efficient Algorithms.

[37]  Eric Gawiser,et al.  Properties of submillimetre galaxies in a semi-analytic model using the `Count Matching' approach: application to the ECDF-S , 2014, 1410.2873.

[38]  Timothy A. Davis,et al.  Quantifying the impact of mergers on the angular momentum of simulated galaxies , 2017, 1701.04407.

[39]  Dvir Shabtay,et al.  A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates , 2006, Comput. Oper. Res..

[40]  Maurice Queyranne,et al.  A study of the Bienstock–Zuckerberg algorithm: applications in mining and resource constrained project scheduling , 2016, Comput. Optim. Appl..

[41]  F. Frances Yao,et al.  A scheduling model for reduced CPU energy , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[42]  Clyde L. Monma,et al.  Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions , 1990, Math. Oper. Res..

[43]  Tei-Wei Kuo,et al.  Power-Saving Scheduling for Weakly Dynamic Voltage Scaling Devices , 2005, WADS.

[44]  Kirk Pruhs,et al.  Speed scaling for weighted flow time , 2007, SODA '07.

[45]  Sanjeev Khanna,et al.  Approximation Algorithms for Minimizing AverageWeighted Completion Time , 2004, Handbook of Scheduling.

[46]  Lachlan L. H. Andrew,et al.  Optimal speed scaling under arbitrary power functions , 2009, SIGMETRICS Perform. Evaluation Rev..

[47]  T. C. Edwin Cheng,et al.  Single machine batch scheduling with resource dependent setup and processing times , 2001, Eur. J. Oper. Res..

[48]  Rajeev Motwani,et al.  Approximation techniques for average completion time scheduling , 1997, SODA '97.

[49]  Kirk Pruhs,et al.  Speed Scaling with an Arbitrary Power Function , 2009, TALG.

[50]  Sandy Irani,et al.  Algorithms for power savings , 2003, SODA '03.

[51]  Jihong Kim,et al.  On energy-optimal voltage scheduling for fixed-priority hard real-time systems , 2003, TECS.

[52]  Adam Janiak,et al.  Single machine scheduling problem with a common deadline and resource dependent release dates , 1991 .

[53]  Kirk Pruhs,et al.  Getting the best response for your erg , 2004, TALG.

[54]  Kirk Pruhs,et al.  Speed Scaling of Tasks with Precedence Constraints , 2005, Theory of Computing Systems.