Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines
This paper deals with a power-aware scheduling of preemptable independent jobs on identical parallel processors where ready time for each job is given and its completion time has to meet a given deadline. Jobs are described by (different) continuous, strictly concave functions relating their processing speeds at a time to the amount of power allotted at the moment. Power is a continuous, doubly constrained resource, i.e. both: its availability at each time instant and consumption over scheduling horizon are constrained. A methodology based on properties of minimum-length schedules is utilized to determine the existence of a feasible schedule for given amounts of energy and power. The question about minimum levels of power and energy ensuring the existence of a feasible schedule for a given set of jobs is also studied.
Year of publication: |
2012
|
---|---|
Authors: | Różycki, R. ; Węglarz, J. |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 218.2012, 1, p. 68-75
|
Publisher: |
Elsevier |
Subject: | Power-aware computing | Preemptable jobs | Ready times | Deadlines | Non-linear programming |
Saved in:
Online Resource
Saved in favorites
Similar items by subject
-
Scheduling semi-malleable jobs to minimize mean flow time
Hendel, Yann, (2015)
-
A note on games corresponding to sequencing situations with due dates
Borm, Peter, (1998)
-
Constraint programming approach to quay crane scheduling problem
Unsal, Ozgur, (2013)
- More ...
Similar items by person