Nonclairvoyantly scheduling power-heterogeneous processors

Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We show that a natural nonclairvoyant online algorithm for scheduling jobs on a power-heterogeneous multiprocessor is bounded-speed bounded-competitive for the objective of flow plus energy.

Original languageEnglish (US)
Title of host publication2010 International Conference on Green Computing, Green Comp 2010
Pages165-173
Number of pages9
DOIs
StatePublished - 2010
Event2010 International Conference on Green Computing, Green Comp 2010 - Chicago, IL, United States
Duration: Aug 15 2010Aug 18 2010

Publication series

Name2010 International Conference on Green Computing, Green Comp 2010

Conference

Conference2010 International Conference on Green Computing, Green Comp 2010
Country/TerritoryUnited States
CityChicago, IL
Period8/15/108/18/10

Keywords

  • Power management
  • Speed scaling

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'Nonclairvoyantly scheduling power-heterogeneous processors'. Together they form a unique fingerprint.

Cite this