Speed scaling on parallel processors with migration

We study the problem of scheduling a set of jobs with release dates, deadlines and processing requirements (works), on parallel speed-scalable processors so as to minimize the total energy consumption. We consider that both preemption and migration of jobs are allowed. We formulate the problem as a convex program and we propose a polynomial-time combinatorial algorithm which is based on a reduction to the maximum flow problem. We extend our algorithm to the multiprocessor speed scaling problem with preemption and migration where the objective is the minimization of the maximum lateness under a budget of energy.

[1]  Christophe Picouleau,et al.  Modèles et Algorithmes en Ordonnancement , 2004 .

[2]  Susanne Albers,et al.  Algorithms for Dynamic Speed Scaling , 2011, STACS.

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

[4]  Mark R. Greenstreet,et al.  Energy Optimal Scheduling on Multiprocessors with Migration , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing with Applications.

[5]  Evripidis Bampis,et al.  Energy-efficient scheduling and routing via randomized rounding , 2013, Journal of Scheduling.

[6]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

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

[8]  Susanne Albers,et al.  On multi-processor speed scaling with migration: extended abstract , 2011, SPAA '11.

[9]  Robert McNaughton,et al.  Scheduling with Deadlines and Loss Functions , 1959 .

[10]  Tei-Wei Kuo,et al.  Multiprocessor energy-efficient scheduling with task migration considerations , 2004, Proceedings. 16th Euromicro Conference on Real-Time Systems, 2004. ECRTS 2004..

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

[12]  Yefim Dinitz,et al.  Dinitz' Algorithm: The Original Version and Even's Version , 2006, Essays in Memory of Shimon Even.

[13]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

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

[15]  Éva Tardos,et al.  Algorithm design , 2005 .

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

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

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

[19]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

[20]  Alexander Souza,et al.  The Bell Is Ringing in Speed-Scaled Multiprocessor Scheduling , 2013, Theory of Computing Systems.

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