On Speed Scaling Scheduling of Parallel Jobs with Preemption

Parallel jobs require more than one processor at the same time. We study speed scaling scheduling of parallel jobs with preemption. We propose “almost-exact” algorithms for problems with rigid jobs and single mode two-processor jobs. Based on configuration linear programs, our algorithms obtain an \(OPT + \varepsilon \) solution for any fixed \(\varepsilon > 0\).

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

[2]  Alexander Souza,et al.  The bell is ringing in speed-scaled multiprocessor scheduling , 2009, SPAA '09.

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

[4]  Klaus Jansen,et al.  Preemptive Scheduling with Dedicated Processors: Applications of Fractional Graph Coloring , 2004, J. Sched..

[5]  Maciej Drozdowski,et al.  Scheduling for Parallel Processing , 2009, Computer Communications and Networks.

[6]  Evripidis Bampis,et al.  Speed scaling on parallel processors with migration , 2011, Euro-Par.

[7]  Klaus Jansen,et al.  Preemptive Parallel Task Scheduling in O(n)+Poly(m) Time , 2000, ISAAC.

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

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

[10]  Maciej Drozdowski.  On the complexity of multiprocessor task scheduling , 1995 .

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

[12]  Claire Mathieu,et al.  Energy-Efficient Algorithms for Non-preemptive Speed-Scaling , 2014, WAOA.

[13]  Johann Hurink,et al.  A survey of offline algorithms for energy minimization under deadline constraints , 2016, J. Sched..