TL-Plane-Based Multi-Core Energy-Efficient Real-Time Scheduling Algorithm for Sporadic Tasks

被引:19
作者
Zhang, Dongsong [1 ]
Guo, Deke [2 ]
Chen, Fangyuan
Wu, Fei [3 ]
Wu, Tong [4 ]
Cao, Ting [5 ]
Jin, Shiyao [1 ]
机构
[1] Natl Univ Def Technol, Sch Comp, PDL, Natl Lab Parallel & Distributed Proc, Changsha, Hunan, Peoples R China
[2] Natl Univ Def Technol, Sch Informat Syst & Management, Changsha, Hunan, Peoples R China
[3] Shanghai Univ Engn Sci, Coll Elect & Elect Engn, Shanghai, Peoples R China
[4] Natl Univ Def Technol, Ctr Natl Secur & Strateg Studies, Changsha, Hunan, Peoples R China
[5] Australian Natl Univ, Res Sch Comp Sci, Canberra, ACT 0200, Australia
基金
美国国家科学基金会; 新加坡国家研究基金会; 中国博士后科学基金;
关键词
Algorithms; Design; Performance; Real-time system; energy-efficient scheduling; multi-core; sporadic task; DYNAMIC VOLTAGE; SCHEDULABILITY;
D O I
10.1145/2086696.2086726
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
080201 [机械制造及其自动化];
摘要
As the energy consumption of multi-core systems becomes increasingly prominent, it's a challenge to design an energy-efficient real-time scheduling algorithm in multi-core systems for reducing the system energy consumption while guaranteeing the feasibility of real-time tasks. In this paper, we focus on multi-core processors, with the global Dynamic Voltage Frequency Scaling (DVFS) and Dynamic Power Management (DPM) technologies. In this setting, we propose an energy-efficient real-time scheduling algorithm, the Time Local remaining execution plane based Dynamic Voltage Frequency Scaling (TL-DVFS). TL-DVFS utilizes the concept of Time Local remaining execution (TL) plane to dynamically scale the voltage and frequency of a processor at the initial time of each TL plane as well as at the release time of a sporadic task in each TL plane. Consequently, TL-DVFS can obtain a reasonable tradeoff between the real-time constraint and the energy-saving while realizing the optimal feasibility of sporadic tasks. Mathematical analysis and extensive simulations demonstrate that TL-DVFS always saves more energy than existing algorithms, especially in the case of high workloads, and guarantees the optimal feasibility of sporadic tasks at the same time.
引用
收藏
页数:20
相关论文
共 35 条
[1]
AlEnawy TA, 2005, RTAS 2005: 11TH IEEE REAL TIME AND EMBEDDED TECHNOLOGY AND APPLICATIONS SYMPOSIUM, PROCEEDINGS, P213
[2]
[Anonymous], 2011, INT I7 PROC SPEC
[3]
[Anonymous], 2008, PARALLEL DISTRIBUTED
[4]
AYDIN H, 2003, P 17 IEEE INT PAR DI, P22
[5]
Analysis of EDF schedulability on a multiprocessor [J].
Baker, TP .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2005, 16 (08) :760-768
[6]
Measuring the performance of schedulability tests [J].
Bini, E ;
Buttazzo, GC .
REAL-TIME SYSTEMS, 2005, 30 (1-2) :129-153
[7]
LOW-POWER CMOS DIGITAL DESIGN [J].
CHANDRAKASAN, AP ;
SHENG, S ;
BRODERSEN, RW .
IEEE JOURNAL OF SOLID-STATE CIRCUITS, 1992, 27 (04) :473-484
[8]
Chen JJ, 2006, PROCEEDINGS OF THE 12TH IEEE REAL-TIME AND EMBEDDED TECHNOLOGY AND APPLICATIONS SYMPOSIUM, P408
[9]
An optimal real-time scheduling algorithm for multiprocessors [J].
Cho, Hyeonjoong ;
Ravindran, Binoy ;
Jensen, E. Douglas .
27TH IEEE INTERNATIONAL REAL-TIME SYSTEMS SYMPOSIUM, PROCEEDINGS, 2006, :101-+
[10]
Priority Assignment for Global Fixed Priority Pre-emptive Scheduling in Multiprocessor Real-Time Systems [J].
Davis, Robert I. ;
Burns, Alan .
2009 30TH IEEE REAL-TIME SYSTEMS SYMPOSIUM, PROCEEDINGS, 2009, :398-409