Optimal energy trade-off schedules - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Optimal energy trade-off schedules

(1) , (2, 3) , (1) , (1)
1
2
3

Abstract

We consider scheduling tasks that arrive over time on a speed scalable processor. At each time a schedule specifies a job to be run and the speed at which the processor is run. Processors are generally less energy efficient at higher speeds. We seek to understand the structure of schedules that optimally trade-off the energy used by the processor with a common scheduling quality of service measure, fractional weighted delay. We assume that there is some user defined parameter β specifying the user's desired additive trade-off between energy efficiency and quality of service. We prove that the optimal energy trade-off schedule is essentially unique, and has a simple structure. Thus it is easy to check the optimality of a schedule. We further prove that the optimal energy trade-off schedule changes continuously as a function of the parameter β. Thus it is possible to compute the optimal energy trade-off schedule using a natural homotopic optimization algorithm. We further show that multiplicative trade-off schedules have fewer desirable properties.
Not file

Dates and versions

hal-00867504 , version 1 (30-09-2013)

Identifiers

  • HAL Id : hal-00867504 , version 1

Cite

Daniel G. Cole, Dimitrios Letsios, Michael Nugent, Kirk R. Pruhs. Optimal energy trade-off schedules. 3rd IEEE International Green Computing Conference (IGCC 2012), Jun 2012, San José, CA., United States. (elec. proc). ⟨hal-00867504⟩
78 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More