Energy-aware partitioning for multiprocessor real-time systems

In this paper, we address the problem of partitioning periodic real-time tasks in a multiprocessor platform by considering both feasibility and energy-awareness perspectives: our objective is to compute the feasible partitioning that results in minimum energy consumption on multiple identical proces...

Full description

Saved in:
Bibliographic Details
Published inProceedings International Parallel and Distributed Processing Symposium p. 9 pp.
Main Authors Aydin, H., Qi Yang
Format Conference Proceeding
LanguageEnglish
Published IEEE 2003
Subjects
Computer science
Dynamic scheduling
Dynamic voltage scaling
Energy consumption
Energy efficiency
Load management
Performance evaluation
Processor scheduling
Real time systems
Runtime
Online AccessGet full text
ISBN0769519261
9780769519265
ISSN1530-2075
DOI10.1109/IPDPS.2003.1213225

Cover

More Information
Summary:In this paper, we address the problem of partitioning periodic real-time tasks in a multiprocessor platform by considering both feasibility and energy-awareness perspectives: our objective is to compute the feasible partitioning that results in minimum energy consumption on multiple identical processors by using variable voltage earliest-deadline-first scheduling. We show that the problem is NP-hard in the strong sense on m /spl ges/ 2 processors even when feasibility is guaranteed a priori. Then, we develop our framework where load balancing plays a major role in producing energy-efficient partitionings. We evaluate the feasibility and energy-efficiency performances of partitioning heuristics experimentally.
ISBN:0769519261
9780769519265
ISSN:1530-2075
DOI:10.1109/IPDPS.2003.1213225