Power-Aware Scheduling of Preemptable Independent Jobs on a Single Processor to Meet a Schedule Deadline

We consider a problem of power allocation to computational jobs performed on a single processor, where jobs may be performed with different speeds. Power/energy is a continuous, doubly-constrained resource whose amount is nonlinearly related to a particular speed of a job. Jobs are preemptable, independent, and all are available at the start of the process. A so-called server problem is considered in which the power usage is to be minimized under the condition that an assumed schedule deadline is met for the completion of the given set of jobs. We analyze two cases of the problem: when the energy amount available is not limited, as well as when it is limited for the entire schedule.