Speed Scaling for Maximum Lateness - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theory of Computing Systems Année : 2016

Speed Scaling for Maximum Lateness

Evripidis Bampis
  • Fonction : Auteur
  • PersonId : 855947
Dimitrios Letsios
  • Fonction : Auteur
  • PersonId : 919841
Ioannis Milis
  • Fonction : Auteur
  • PersonId : 947052

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, under a given budget of energy. In the offline setting, our main contribution is a combinatorial polynomial time algorithm for the case in which the jobs have common release dates. In the presence of arbitrary release dates, we show that the problem becomes strongly NP-hard. Moreover, we show that there is no O(1)-competitive deterministic algorithm for the online setting in which the jobs arrive over time. Then, we turn our attention to an aggregated variant of the problem, where the objective is to find a schedule minimizing a linear combination of maximum lateness and energy. As we show, our results for the budget variant can be adapted to derive a similar polynomial time algorithm and an NP-hardness proof for the aggregated variant in the offline setting, with common and arbitrary release dates respectively. More interestingly, for the online case, we propose a 2-competitive algorithm.
Fichier non déposé

Dates et versions

hal-01366455 , version 1 (14-09-2016)

Identifiants

Citer

Evripidis Bampis, Dimitrios Letsios, Ioannis Milis, Georgios Zois. Speed Scaling for Maximum Lateness. Theory of Computing Systems, 2016, 58 (2), pp.304-321. ⟨10.1007/s00224-015-9622-8⟩. ⟨hal-01366455⟩
60 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More