Scheduling on power-heterogeneous processors

Susanne Albers, Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Richard Stotz

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Scopus citations

Abstract

We consider the problem of scheduling a set of jobs, each one specified by its release date, its deadline and its processing volume, on a set of heterogeneous speed-scalable processors, where the energyconsumption rate is processor-dependent. Our objective is to minimize the total energy consumption when both the preemption and the migration of jobs are allowed. We propose a new algorithm based on a compact linear programming formulation. Our method approaches the value of the optimal solution within any desired accuracy for a large set of continuous power functions. Furthermore, we develop a faster combinatorial algorithm based on flows for standard power functions and jobs whose density is lower bounded by a small constant. Finally, we extend and analyze the A Verage Rate (AVR) online algorithm in the heterogeneous setting.

Original languageEnglish
Title of host publicationLATIN 2016
Subtitle of host publicationTheoretical Informatics - 12th Latin American Symposium, Proceedings
EditorsGonzalo Navarro, Evangelos Kranakis, Edgar Chávez
PublisherSpringer Verlag
Pages41-54
Number of pages14
ISBN (Print)9783662495285
DOIs
StatePublished - 2016
Event12th Latin American Symposium on Theoretical Informatics, LATIN 2016 - Ensenada, Mexico
Duration: 11 Apr 201615 Apr 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9644
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference12th Latin American Symposium on Theoretical Informatics, LATIN 2016
Country/TerritoryMexico
CityEnsenada
Period11/04/1615/04/16

Fingerprint

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

Cite this