Scheduling for energy minimization on restricted parallel processors
We propose an optimal scheduling algorithm for the case when all of the tasks have uniform computational work. We present a polynomial-time algorithm that achieves a bounded approximation factor when the tasks have arbitrary-size work. We evaluate the performance of the approximation algorithm by a set of simulations.
restricted parallel processors approximation algorithm energy-efficient scheduling speed scaling continuous speed model