Global scheduling based reliability-aware power management for multiprocessor real-time systems

被引:12
作者
Qi, Xuan [1 ]
Zhu, Dakai [1 ]
Aydin, Hakan [2 ]
机构
[1] Univ Texas San Antonio, Dept Comp Sci, San Antonio, TX 78249 USA
[2] George Mason Univ, Dept Comp Sci, Fairfax, VA 22030 USA
基金
美国国家科学基金会;
关键词
Energy management; Dynamic voltage and frequency scaling; Reliability management; Multiprocessor real-time systems; ERRORS;
D O I
10.1007/s11241-011-9117-x
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Reliability-aware power management (RAPM) has been a recent research focus due to the negative effects of the popular power management technique dynamic voltage and frequency scaling (DVFS) on system reliability. As a result, several RAPM schemes have been studied for uniprocessor real-time systems. In this paper, for a set of frame-based independent real-time tasks running on multiprocessor systems, we study global scheduling based RAPM (G-RAPM) schemes. Depending on how recovery blocks are scheduled and utilized, both individual-recovery and shared-recovery based G-RAPM schemes are investigated. An important dimension of the G-RAPM problem is how to select the appropriate subset of tasks for energy and reliability management (i.e., scale down their executions while ensuring that they can be recovered from transient faults). We show that making such decision optimally (i.e., the static G-RAPM problem) is NP-hard. Then, for the individual-recovery based approach, we study two efficient heuristics, which rely on local and global task selections, respectively. For the shared-recovery based approach, a linear search based scheme is proposed. The schemes are shown to guarantee the timing constraints. Moreover, to reclaim the dynamic slack generated at runtime from early completion of tasks and unused recoveries, we also propose online G-RAPM schemes which exploit the slack-sharing idea studied in previous work. The proposed schemes are evaluated through extensive simulations. The results show the effectiveness of the proposed schemes in yielding energy savings while simultaneously preserving system reliability and timing constraints. For the static version of the problem, the shared-recovery based scheme is shown to provide better energy savings compared to the individual-recovery based scheme, in virtue of its ability to leave more slack for DVFS. Moreover, by reclaiming the dynamic slack generated at runtime, online G-RAPM schemes are shown to yield better energy savings.
引用
收藏
页码:109 / 142
页数:34
相关论文
共 52 条
[1]  
AlEnawy TA, 2005, RTAS 2005: 11TH IEEE REAL TIME AND EMBEDDED TECHNOLOGY AND APPLICATIONS SYMPOSIUM, PROCEEDINGS, P213
[2]   Energy-efficient synthesis of periodic task systems upon identical multiprocessor platforms [J].
Anderson, JH ;
Baruah, SK .
24TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGS, 2004, :428-435
[3]   Power-aware scheduling for periodic real-time tasks [J].
Aydin, H ;
Melhem, R ;
Mossé, D ;
Mejía-Alvarez, P .
IEEE TRANSACTIONS ON COMPUTERS, 2004, 53 (05) :584-600
[4]  
AYDIN H, 2001, P 22 IEEE REAL TIM S
[5]  
AYDIN H, 2003, P 17 INT PAR DISTR P
[6]  
Aydin H., 2006, P 27 IEEE REAL TIM S
[7]  
BURD TD, 1995, P HICSS C
[8]  
Chen JJ, 2006, PROCEEDINGS OF THE 12TH IEEE REAL-TIME AND EMBEDDED TECHNOLOGY AND APPLICATIONS SYMPOSIUM, P408
[9]  
Chen JJ, 2005, PROC INT CONF PARAL, P13
[10]   Multiprocessor energy-efficient scheduling with task migration considerations [J].
Chen, JJ ;
Hsu, HR ;
Chuang, KH ;
Yang, CL ;
Pang, AC ;
Kuo, TW .
16TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS, PROCEEDINGS, 2004, :101-108