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

Sushu Zhang; Karam S. Chatha; Goran Konjevod

doi:10.1145/1283780.1283828

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

Sushu Zhang, Karam S. Chatha, Goran Konjevod

Computing and Augmented Intelligence, School of (IAFSE-SCAI)

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

19 Scopus citations

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 language	English (US)
Title of host publication	ISLPED'07
Subtitle of host publication	Proceedings of the 2007 International Symposium on Low Power Electronics and Design
Pages	225-230
Number of pages	6
DOIs	https://doi.org/10.1145/1283780.1283828
State	Published - 2007
Event	ISLPED'07: 2007 International Symposium on Low Power Electronics and Design - Portland, OR, United States Duration: Aug 27 2007 → Aug 29 2007

Publication series

Name	Proceedings of the International Symposium on Low Power Electronics and Design
ISSN (Print)	1533-4678

Other

Other	ISLPED'07: 2007 International Symposium on Low Power Electronics and Design
Country/Territory	United States
City	Portland, OR
Period	8/27/07 → 8/29/07

Keywords

Earliest deadline first
Low power design
Rate monotonic

ASJC Scopus subject areas

Engineering(all)

Access to Document

10.1145/1283780.1283828

Cite this

Zhang, S., Chatha, K. S., & Konjevod, G. (2007). Approximation algorithms for power minimization of earliest deadline first and rate monotonic schedules. In ISLPED'07: Proceedings of the 2007 International Symposium on Low Power Electronics and Design (pp. 225-230). (Proceedings of the International Symposium on Low Power Electronics and Design). 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.
ISLPED'07: Proceedings of the 2007 International Symposium on Low Power Electronics and Design. 2007. p. 225-230 (Proceedings of the International Symposium on Low Power Electronics and Design).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Zhang, S, Chatha, KS & Konjevod, G 2007, Approximation algorithms for power minimization of earliest deadline first and rate monotonic schedules. in ISLPED'07: Proceedings of the 2007 International Symposium on Low Power Electronics and Design. 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

@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",

series = "Proceedings of the International Symposium on Low Power Electronics and Design",

pages = "225--230",

booktitle = "ISLPED'07",

note = "ISLPED'07: 2007 International Symposium on Low Power Electronics and Design ; Conference date: 27-08-2007 Through 29-08-2007",

}

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

AN - SCOPUS:36949009824

SN - 1595937099

SN - 9781595937094

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

SP - 225

EP - 230

BT - ISLPED'07

T2 - ISLPED'07: 2007 International Symposium on Low Power Electronics and Design

Y2 - 27 August 2007 through 29 August 2007

ER -

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

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this