Energy Aware Scheduling for Unrelated Parallel Machines

We consider the problem of energy aware scheduling of a set of jobs on a set of unrelated parallel machines with the average weighted completion time plus energy objective. The processing time and the energy consumption of the jobs are machine and speed dependent. Also, every job is subject to a machine-dependent release date. Firstly, we aim to find a non-preemptive schedule of the jobs minimizing the average weighted completion time plus energy, and we propose a randomized approximation algorithm that we derandomize obtaining a deterministic approximation algorithm. We then consider the budget variant of the problem where the objective is to minimize the average completion time while the total energy consumption does not exceed a given budget.

[1]  Kirk Pruhs,et al.  Getting the Best Response for Your Erg , 2004, SWAT.

[2]  Fabián A. Chudak.  A min‐sum 3/2‐approximation algorithm for scheduling unrelated parallel machines , 1999 .

[3]  Peng Zhang,et al.  Non-clairvoyant Scheduling for Weighted Flow Time and Energy on Speed Bounded Processors , 2011, Chic. J. Theor. Comput. Sci..

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

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

[6]  Martin Skutella,et al.  Scheduling Unrelated Machines by Randomized Rounding , 2002, SIAM J. Discret. Math..

[7]  Jeffrey Scott Vitter,et al.  e-approximations with minimum packing constraint violation (extended abstract) , 1992, STOC '92.

[8]  Michael A. Trick,et al.  Scheduling Multiple Variable-Speed Machines , 1990, Oper. Res..

[9]  Evripidis Bampis,et al.  Approximation schemes for minimizing average weighted completion time with release dates , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[10]  Xiaotie Deng,et al.  Deterministic load balancing in computer networks , 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.

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

[12]  BansalNikhil,et al.  Speed scaling to manage energy and temperature , 2007 .

[13]  Edward G. Coffman,et al.  Scheduling independent tasks to reduce mean finishing time , 1974, CACM.

[14]  Uri C. Weiser,et al.  Performance, power efficiency and scalability of asymmetric cluster chip multiprocessors , 2006, IEEE Computer Architecture Letters.

[15]  Gerhard J. Woeginger,et al.  A Review of Machine Scheduling: Complexity, Algorithms and Approximability , 1998 .

[16]  Landon P. Cox,et al.  The Impact of Dynamically Heterogeneous Multicore Processors on Thread Scheduling , 2008, IEEE Micro.

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

[18]  Sanjeev Khanna,et al.  A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines , 2001, ICALP.

[19]  Baruch Awerbuch,et al.  Competitive distributed job scheduling (extended abstract) , 1992, STOC '92.

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

[21]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

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

[23]  Prudence W. H. Wong,et al.  Sleep with Guilt and Work Faster to Minimize Flow Plus Energy , 2009, ICALP.

[24]  Susanne Albers,et al.  Speed scaling on parallel processors , 2007, SPAA.

[25]  Prudence W. H. Wong,et al.  Optimizing throughput and energy in online deadline scheduling , 2009, TALG.

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

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

[28]  Norman P. Jouppi,et al.  Single-ISA heterogeneous multi-core architectures for multithreaded workload performance , 2004, Proceedings. 31st Annual International Symposium on Computer Architecture, 2004..

[29]  David P. Bunde.  Power-aware scheduling for makespan and flow , 2009, J. Sched..

[30]  Martin Skutella,et al.  Convex quadratic and semidefinite programming relaxations in scheduling , 2001, JACM.

[31]  Kirk Pruhs,et al.  Scalably Scheduling Power-Heterogeneous Processors , 2010, ICALP.

[32]  Evripidis Bampis,et al.  A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs , 2001, ESA.

[33]  Evripidis Bampis,et al.  On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems , 2003, Theor. Comput. Sci..

[34]  Éva Tardos,et al.  An approximation algorithm for the generalized assignment problem , 1993, Math. Program..

[35]  Prudence W. H. Wong,et al.  Competitive non-migratory scheduling for flow time and energy , 2008, SPAA '08.

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

[37]  Klaus Jansen,et al.  Improved Approximation Schemes for Scheduling Unrelated Parallel Machines , 2001, Math. Oper. Res..

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