Optimal energy trade-off schedules

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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00859925
Contributor : Frédéric Davesne <>
Submitted on : Wednesday, May 6, 2015 - 1:41:24 PM
Last modification on : Monday, October 28, 2019 - 10:50:21 AM
Long-term archiving on: Monday, September 14, 2015 - 7:41:55 PM

File

OptimalEnergyTrade-offSchedule...
Files produced by the author(s)

Identifiers

Citation

Neal Barcelo, Daniel G. Cole, Dimitrios Letsios, Michael Nugent, Kirk R. Pruhs. Optimal energy trade-off schedules. Sustainable Computing : Informatics and Systems, Elsevier, 2013, 3 (3), pp.207--217. ⟨10.1016/j.suscom.2013.01.007⟩. ⟨hal-00859925⟩

Share

Metrics

Record views

368

Files downloads

259