Power aware scheduling of preemptive jobs on multi-core processors

The problem of power aware scheduling of preemptive jobs on a multi-core processor is considered. The jobs may be performed with different processing rates using different amount of power. Cores of a processor, possibly with different characteristics, are driven by a common power source with a limited capacity. The problem is to find both: an assignment of jobs to cores and simultaneously a power allocation in order to minimize the schedule length. We describe a general method for solving the problem and propose an approach for finding the solution in the case where number of cores is equal to the number of jobs.