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.

► General methodology for solving the problem is proposed. ► Jobs are modeled by different continuous, strictly concave speed functions. ► Limits for available amounts of power/energy are respected in the model. ► Existence of a feasible schedule for given energy and power is determined. ► Reduction to the corresponding mathematical programming problem is showed.