Skip to Main content Skip to Navigation
Journal articles

Speed scaling with power down scheduling for agreeable deadlines

Abstract : We consider the problem of scheduling on a single processor a given set of n jobs. Each job j has a workload wj and a release time r j. The processor can vary its speed and hibernate to reduce energy consumption. In a schedule minimizing overall consumed energy, it might be that some jobs complete arbitrarily far from their release time. So in order to guarantee some quality of service, we would like to impose a deadline d j = rj + F for every job j, where F is a guarantee on the flow time. We provide an O(n3) algorithm for the more general case of agreeable deadlines, where jobs have release times and deadlines and can be ordered such that for every i < j, both ri rj and di dj.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00868700
Contributor : Frédéric Davesne <>
Submitted on : Tuesday, October 1, 2013 - 5:51:32 PM
Last modification on : Thursday, August 27, 2020 - 3:40:04 PM

Links full text

Identifiers

Citation

Evripidis Bampis, Christoph Dürr, Fadi Kacem, Ioannis Z. Milis. Speed scaling with power down scheduling for agreeable deadlines. Sustainable Computing : Informatics and Systems, Elsevier, 2012, 2 (4), pp.184--189. ⟨10.1016/j.suscom.2012.10.003⟩. ⟨hal-00868700⟩

Share

Metrics

Record views

256