Scalably Scheduling Power-Heterogeneous Processors

  • Anupam Gupta
  • Ravishankar Krishnaswamy
  • Kirk Pruhs
Conference paper

DOI: 10.1007/978-3-642-14165-2_27

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6198)
Cite this paper as:
Gupta A., Krishnaswamy R., Pruhs K. (2010) Scalably Scheduling Power-Heterogeneous Processors. In: Abramsky S., Gavoille C., Kirchner C., Meyer auf der Heide F., Spirakis P.G. (eds) Automata, Languages and Programming. ICALP 2010. Lecture Notes in Computer Science, vol 6198. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Anupam Gupta
    • 1
  • Ravishankar Krishnaswamy
    • 1
  • Kirk Pruhs
    • 2
  1. 1.Computer Science Dept.Carnegie Mellon UniversityPittsburghUSA
  2. 2.Computer Science Dept.University of PittsburghPittsburghUSA

Personalised recommendations