Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count

We study online scheduling to minimize flow time plus energy usage in the dynamic speed scaling model. We devise new speed scaling functions that depend on the number of active jobs, replacing the existing speed scaling functions in the literature that depend on the remaining work of active jobs. The new speed functions are more stable and also more efficient. They can support better job selection strategies to improve the competitive ratios of existing algorithms [8,5], and, more importantly, to remove the requirement of extra speed. These functions further distinguish themselves from others as they can readily be used in the non-clairvoyant model (where the size of a job is only known when the job finishes). As a first step, we study the scheduling of batched jobs (i.e., jobs with the same release time) in the non-clairvoyant model and present the first competitive algorithm for minimizing flow time plus energy (as well as for weighted flow time plus energy); the performance is close to optimal.

[1]  Susanne Albers,et al.  Speed Scaling on Parallel Processors , 2007, SPAA '07.

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

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

[4]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[5]  Philip Levis,et al.  Policies for dynamic clock scheduling , 2000, OSDI.

[6]  Linus Schrage,et al.  Letter to the Editor - A Proof of the Optimality of the Shortest Remaining Processing Time Discipline , 1968, Oper. Res..

[7]  Kirk Pruhs,et al.  Online weighted flow time and deadline scheduling , 2001, J. Discrete Algorithms.

[8]  Nikhil Bansal,et al.  Minimizing weighted flow time , 2007, ACM Trans. Algorithms.

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

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

[11]  Trevor N. Mudge,et al.  Power: A First-Class Architectural Design Constraint , 2001, Computer.

[12]  Manish Gupta,et al.  Power-Aware Microarchitecture: Design and Modeling Challenges for Next-Generation Microprocessors , 2000, IEEE Micro.

[13]  Jae-Hoon Kim,et al.  Non-clairvoyant scheduling for weighted flow time , 2003, Inf. Process. Lett..

[14]  Rajeev Motwani,et al.  Non-clairvoyant scheduling , 1994, SODA '93.

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

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

[17]  Prudence W. H. Wong,et al.  Energy efficient online deadline scheduling , 2007, SODA '07.

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

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

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

[21]  Bala Kalyanasundaram,et al.  Speed is as powerful as clairvoyance , 2000, JACM.

[22]  David P. Bunde.  Power-aware scheduling for makespan and flow , 2006, SPAA '06.