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.

[1]  Stefano Leonardi,et al.  Approximating total flow time on parallel machines , 1997, STOC '97.

[2]  Kirk Pruhs,et al.  Online scheduling , 2003 .

[3]  Norman P. Jouppi,et al.  Single-ISA heterogeneous multi-core architectures for multithreaded workload performance , 2004, Proceedings. 31st Annual International Symposium on Computer Architecture, 2004..

[4]  Uri C. Weiser,et al.  Performance, power efficiency and scalability of asymmetric cluster chip multiprocessors , 2006, IEEE Computer Architecture Letters.

[5]  Norman P. Jouppi,et al.  Core architecture optimization for heterogeneous chip multiprocessors , 2006, 2006 International Conference on Parallel Architectures and Compilation Techniques (PACT).

[6]  Kirk Pruhs,et al.  Online weighted flow time and deadline scheduling , 2006, J. Discrete Algorithms.

[7]  Kirk Pruhs,et al.  Speed scaling for weighted flow time , 2007, SODA '07.

[8]  Kirk Pruhs.  Competitive online scheduling for server systems , 2007, PERV.

[9]  Susanne Albers,et al.  Energy-efficient algorithms for flow time minimization , 2006, STACS.

[10]  Kirk Pruhs,et al.  Getting the best response for your erg , 2004, TALG.

[11]  Prudence W. H. Wong,et al.  Competitive non-migratory scheduling for flow time and energy , 2008, SPAA '08.

[12]  Landon P. Cox,et al.  The Impact of Dynamically Heterogeneous Multicore Processors on Thread Scheduling , 2008, IEEE Micro.

[13]  Prudence W. H. Wong,et al.  Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count , 2008, ESA.

[14]  Nikhil Bansal,et al.  Scheduling for Speed Bounded Processors , 2008, ICALP.

[15]  V. N. Muralidhara,et al.  A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation , 2009, STOC '09.

[16]  N. Bansal,et al.  Speed scaling with an arbitrary power function , 2009, SODA 2009.

[17]  Lachlan L. H. Andrew,et al.  Optimal speed scaling under arbitrary power functions , 2009, SIGMETRICS Perform. Evaluation Rev..

[18]  Nikhil Bansal,et al.  Weighted flow time does not admit O(1)-competitive algorithms , 2009, SODA.

[19]  Kirk Pruhs,et al.  Nonclairvoyant Speed Scaling for Flow and Energy , 2010, Algorithmica.