Power-Aware Scheduling for Makespan and Flow ( Extended

@inproceedings{Bunde2006PowerAwareSF,
  title={Power-Aware Scheduling for Makespan and Flow ( Extended},
  author={David P. Bunde and david. bunde},
  year={2006}
}
We consider offline scheduling algorithms that incorporate speed scaling to address the bicriteria problem of minimizing energy consumption and a scheduling metric. For makespan, we give linear-time algorithms to compute all non-dominated solutions for the general uniprocessor problem and for the multiprocessor problem when every job requires the same… CONTINUE READING