Communication Dans Un Congrès Année : 2012

Speed scaling for maximum lateness

Résumé

We consider the power-aware problem of scheduling non-preemptively a set of jobs on a single speed-scalable processor so as to minimize the maximum lateness. We consider two variants of the problem: In the budget variant we aim in finding a schedule minimizing the maximum lateness for a given budget of energy, while in the aggregated variant our objective is to find a schedule minimizing a linear combination of maximum lateness and energy. We present polynomial time algorithms for both variants of the problem without release dates and we prove that both variants become strongly -hard in the presence of arbitrary release dates. Moreover, we show that, for arbitrary release dates, there is no O(1)-competitive online algorithm for the budget variant and we propose a 2-competitive one for the aggregated variant.
Fichier principal
Vignette du fichier
lateness.pdf (208.86 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00820163 , version 1 (20-01-2025)

Licence

Identifiants

Citer

Evripidis Bampis, Dimitrios Letsios, Ioannis Z. Milis, Georgios Zois. Speed scaling for maximum lateness. 18th Annual International Computing and Combinatorics Conference (COCOON 2012), Joachim Gudmundsson; Julián Mestre; Taso Viglas, Aug 2012, Sydney, Australia. pp.25-36, ⟨10.1007/978-3-642-32241-9_3⟩. ⟨hal-00820163⟩
146 Consultations
0 Téléchargements

Altmetric

Partager

More