Power-aware scheduling of mixed task sets in priority-driven systems

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

We propose power-aware on-line task scheduling algorithms for mixed task sets which consist of both periodic and aperiodic tasks. The proposed algorithms utilize the execution behaviors of scheduling servers for aperiodic tasks. Since there is a trade-off between the energy consumption and the response time of aperiodic tasks, the proposed algorithms focus on bounding the response time degradation of aperiodic tasks while they use a more aggressive slack estimation technique for higher energy savings in mixed task sets. We also propose a new slack distribution method which gives better response times with slight energy increases. Experimental results show that the proposed algorithms reduce the energy consumption by 25% and 18% over the non-DVS scheme under the RM scheduling and the EDF scheduling, respectively.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsLaurence T. Yang, Minyi Guo, Guang R. Gao, Niraj K. Jha
PublisherSpringer Verlag
Pages227-237
Number of pages11
ISBN (Print)354022906X, 9783540229063
DOIs
StatePublished - 2004
Externally publishedYes

Publication series

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

Fingerprint

Dive into the research topics of 'Power-aware scheduling of mixed task sets in priority-driven systems'. Together they form a unique fingerprint.

Cite this