Approximation algorithms for power minimization of earliest deadline first and rate monotonic schedules

Sushu Zhang, Karam S. Chatha, Goran Konjevod

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

19 Citations (Scopus)

Abstract

We address power minimization of earliest deadline first and ratemonotonic schedules by voltage and frequency scaling. We prove that the problems are NP-hard, and present (1+ε) fully polynomial time approximation techniques that generate solutions which are guaranteed to be within a specified quality bound (QB=ε) (say within 1% of the optimal). We demonstrate that our techniques can match optimal solutions when QB is set at 1%, out perform existing approaches [1] even when QB is set at 10%, generate solutions that are quite close to optimal (≤ 5%) even when QB is set at higher values (25%), and execute in a fraction of a second (with QB ≥ 5%) for large 100 node task sets.

Original languageEnglish (US)
Title of host publicationProceedings of the International Symposium on Low Power Electronics and Design
Pages225-230
Number of pages6
DOIs
StatePublished - 2007
EventISLPED'07: 2007 International Symposium on Low Power Electronics and Design - Portland, OR, United States
Duration: Aug 27 2007Aug 29 2007

Other

OtherISLPED'07: 2007 International Symposium on Low Power Electronics and Design
CountryUnited States
CityPortland, OR
Period8/27/078/29/07

Fingerprint

Approximation algorithms
Computational complexity
Polynomials
Electric potential

Keywords

  • Earliest deadline first
  • Low power design
  • Rate monotonic

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Zhang, S., Chatha, K. S., & Konjevod, G. (2007). Approximation algorithms for power minimization of earliest deadline first and rate monotonic schedules. In Proceedings of the International Symposium on Low Power Electronics and Design (pp. 225-230) https://doi.org/10.1145/1283780.1283828

Approximation algorithms for power minimization of earliest deadline first and rate monotonic schedules. / Zhang, Sushu; Chatha, Karam S.; Konjevod, Goran.

Proceedings of the International Symposium on Low Power Electronics and Design. 2007. p. 225-230.

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

Zhang, S, Chatha, KS & Konjevod, G 2007, Approximation algorithms for power minimization of earliest deadline first and rate monotonic schedules. in Proceedings of the International Symposium on Low Power Electronics and Design. pp. 225-230, ISLPED'07: 2007 International Symposium on Low Power Electronics and Design, Portland, OR, United States, 8/27/07. https://doi.org/10.1145/1283780.1283828
Zhang S, Chatha KS, Konjevod G. Approximation algorithms for power minimization of earliest deadline first and rate monotonic schedules. In Proceedings of the International Symposium on Low Power Electronics and Design. 2007. p. 225-230 https://doi.org/10.1145/1283780.1283828
Zhang, Sushu ; Chatha, Karam S. ; Konjevod, Goran. / Approximation algorithms for power minimization of earliest deadline first and rate monotonic schedules. Proceedings of the International Symposium on Low Power Electronics and Design. 2007. pp. 225-230
@inproceedings{5baed5afde464b3987f93e696b3c8ba6,
title = "Approximation algorithms for power minimization of earliest deadline first and rate monotonic schedules",
abstract = "We address power minimization of earliest deadline first and ratemonotonic schedules by voltage and frequency scaling. We prove that the problems are NP-hard, and present (1+ε) fully polynomial time approximation techniques that generate solutions which are guaranteed to be within a specified quality bound (QB=ε) (say within 1{\%} of the optimal). We demonstrate that our techniques can match optimal solutions when QB is set at 1{\%}, out perform existing approaches [1] even when QB is set at 10{\%}, generate solutions that are quite close to optimal (≤ 5{\%}) even when QB is set at higher values (25{\%}), and execute in a fraction of a second (with QB ≥ 5{\%}) for large 100 node task sets.",
keywords = "Earliest deadline first, Low power design, Rate monotonic",
author = "Sushu Zhang and Chatha, {Karam S.} and Goran Konjevod",
year = "2007",
doi = "10.1145/1283780.1283828",
language = "English (US)",
isbn = "1595937099",
pages = "225--230",
booktitle = "Proceedings of the International Symposium on Low Power Electronics and Design",

}

TY - GEN

T1 - Approximation algorithms for power minimization of earliest deadline first and rate monotonic schedules

AU - Zhang, Sushu

AU - Chatha, Karam S.

AU - Konjevod, Goran

PY - 2007

Y1 - 2007

N2 - We address power minimization of earliest deadline first and ratemonotonic schedules by voltage and frequency scaling. We prove that the problems are NP-hard, and present (1+ε) fully polynomial time approximation techniques that generate solutions which are guaranteed to be within a specified quality bound (QB=ε) (say within 1% of the optimal). We demonstrate that our techniques can match optimal solutions when QB is set at 1%, out perform existing approaches [1] even when QB is set at 10%, generate solutions that are quite close to optimal (≤ 5%) even when QB is set at higher values (25%), and execute in a fraction of a second (with QB ≥ 5%) for large 100 node task sets.

AB - We address power minimization of earliest deadline first and ratemonotonic schedules by voltage and frequency scaling. We prove that the problems are NP-hard, and present (1+ε) fully polynomial time approximation techniques that generate solutions which are guaranteed to be within a specified quality bound (QB=ε) (say within 1% of the optimal). We demonstrate that our techniques can match optimal solutions when QB is set at 1%, out perform existing approaches [1] even when QB is set at 10%, generate solutions that are quite close to optimal (≤ 5%) even when QB is set at higher values (25%), and execute in a fraction of a second (with QB ≥ 5%) for large 100 node task sets.

KW - Earliest deadline first

KW - Low power design

KW - Rate monotonic

UR - http://www.scopus.com/inward/record.url?scp=36949009824&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=36949009824&partnerID=8YFLogxK

U2 - 10.1145/1283780.1283828

DO - 10.1145/1283780.1283828

M3 - Conference contribution

SN - 1595937099

SN - 9781595937094

SP - 225

EP - 230

BT - Proceedings of the International Symposium on Low Power Electronics and Design

ER -