Part of the Lecture Notes in Computer Science book series (LNCS, volume 6198)
Scalably Scheduling Power-Heterogeneous Processors
We show that a natural online algorithm for scheduling jobs on a heterogeneous multiprocessor, with arbitrary power functions, is scalable for the objective function of weighted flow plus energy.
Unable to display preview. Download preview PDF.
© Springer-Verlag Berlin Heidelberg 2010