Energy minimizing for parallel real-time tasks based on level-packing

Huiting Xu; Fanxin Kong; Qingxu Deng

doi:10.1109/RTCSA.2012.10

Energy minimizing for parallel real-time tasks based on level-packing

Huiting Xu, Fanxin Kong, Qingxu Deng

Research output: Contribution to conference › Paper › peer-review

31 Scopus citations

Abstract

While much work has addressed energy minimizing problem of real-time sequential tasks, little has been done for the parallel real-time task case. In this paper, based on level-packing, we study energy minimization problem for parallel task systems with discrete operation modes and under timing constraints. For tasks with fixed (variable) parallel degrees, we first formulate the problem as a 0-1 Integer Linear Program (0-1 ILP), and then propose a polynomial-time complexity two-step (three-step) heuristic to determine task schedule and frequency assignment (and the task parallel degree). Our simulation result shows that the heuristics consume nearly the same energy as do 0-1 ILPs.

Original language	English (US)
Pages	98-103
Number of pages	6
DOIs	https://doi.org/10.1109/RTCSA.2012.10
State	Published - 2012
Externally published	Yes
Event	18th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2012 - Seoul, Korea, Republic of Duration: Aug 19 2012 → Aug 22 2012

Other

Other	18th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2012
Country/Territory	Korea, Republic of
City	Seoul
Period	8/19/12 → 8/22/12

ASJC Scopus subject areas

Artificial Intelligence
Hardware and Architecture
Computer Vision and Pattern Recognition

Access to Document

10.1109/RTCSA.2012.10

Cite this

@conference{940f6c0cf6cc418d8d21e3fc4f31059f,

title = "Energy minimizing for parallel real-time tasks based on level-packing",

abstract = "While much work has addressed energy minimizing problem of real-time sequential tasks, little has been done for the parallel real-time task case. In this paper, based on level-packing, we study energy minimization problem for parallel task systems with discrete operation modes and under timing constraints. For tasks with fixed (variable) parallel degrees, we first formulate the problem as a 0-1 Integer Linear Program (0-1 ILP), and then propose a polynomial-time complexity two-step (three-step) heuristic to determine task schedule and frequency assignment (and the task parallel degree). Our simulation result shows that the heuristics consume nearly the same energy as do 0-1 ILPs.",

author = "Huiting Xu and Fanxin Kong and Qingxu Deng",

year = "2012",

doi = "10.1109/RTCSA.2012.10",

language = "English (US)",

pages = "98--103",

note = "18th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2012 ; Conference date: 19-08-2012 Through 22-08-2012",

}

TY - CONF

T1 - Energy minimizing for parallel real-time tasks based on level-packing

AU - Xu, Huiting

AU - Kong, Fanxin

AU - Deng, Qingxu

PY - 2012

Y1 - 2012

N2 - While much work has addressed energy minimizing problem of real-time sequential tasks, little has been done for the parallel real-time task case. In this paper, based on level-packing, we study energy minimization problem for parallel task systems with discrete operation modes and under timing constraints. For tasks with fixed (variable) parallel degrees, we first formulate the problem as a 0-1 Integer Linear Program (0-1 ILP), and then propose a polynomial-time complexity two-step (three-step) heuristic to determine task schedule and frequency assignment (and the task parallel degree). Our simulation result shows that the heuristics consume nearly the same energy as do 0-1 ILPs.

AB - While much work has addressed energy minimizing problem of real-time sequential tasks, little has been done for the parallel real-time task case. In this paper, based on level-packing, we study energy minimization problem for parallel task systems with discrete operation modes and under timing constraints. For tasks with fixed (variable) parallel degrees, we first formulate the problem as a 0-1 Integer Linear Program (0-1 ILP), and then propose a polynomial-time complexity two-step (three-step) heuristic to determine task schedule and frequency assignment (and the task parallel degree). Our simulation result shows that the heuristics consume nearly the same energy as do 0-1 ILPs.

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

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

U2 - 10.1109/RTCSA.2012.10

DO - 10.1109/RTCSA.2012.10

M3 - Paper

AN - SCOPUS:84869023062

SP - 98

EP - 103

T2 - 18th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2012

Y2 - 19 August 2012 through 22 August 2012

ER -

Energy minimizing for parallel real-time tasks based on level-packing

Abstract

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this