| 引用本文: | 张冬松,郭得科,陈芳园,等.多核系统中基于动态松弛时间回收的节能实时调度算法.[J].国防科技大学学报,2011,33(6):7-16.[点击复制] |
| ZHANG Dongsong,GUO Deke,CHEN Fangyuan,et al.An Energy-efficient Multi-core Real-time Scheduling Algorithm Based on Dynamic Slack Reclamation[J].Journal of National University of Defense Technology,2011,33(6):7-16[点击复制] |
|
| |
|
|
| 本文已被：浏览 7466次 下载 6095次 |
| 多核系统中基于动态松弛时间回收的节能实时调度算法 |
|
|
(1.国防科技大学 计算机学院，湖南 长沙 410073;2.国防科技大学 信息系统工程重点实验室，湖南 长沙 410073;3.国防科技大学 国家安全与军事战略研究中心，湖南 长沙 410073;4.上海工程技术大学 电子电气工程学院，上海 201620）)
|
| 摘要: |
| 许多嵌入式实时任务的实际执行时间往往小于最坏情况执行时间，因此可以产生大量的动态松弛时间。针对时限等于周期的偶发任务集，提出一种基于动态松弛时间回收的多核系统节能实时调度算法LRE-DVFS-ALL。该算法基于最优在线调度算法LRE-TL，利用TL面内节能实时调度思想，在每个TL面的提前完成时刻实现动态松弛时间回收，降低后续偶发任务的执行频率，实现更多的节能。同时该算法还在每个TL面的初始时刻、偶发任务的释放时刻实现动态电压和频率调节，保证了偶发任务集最优可调度性。经过系统的数学分析和仿真，结果表明，LRE-DVFS-ALL算法不仅保证了偶发任务集的最优可调度性，而且当任务集总负载超过某一个值后，其节能效果始终优于现有方法，尤其随着总负载的增加，节能效果会更好。 |
| 关键词: 实时系统 节能调度 多核 动态松弛时间 |
| DOI： |
| 投稿日期：2011-06-01 |
| 基金项目:国家自然科学基金资助项目（60903206, 60803152, 60972166）；国家教育部博士点基金资助项目（20104307110005）；国家部委资助项目；国防科技大学资助项目；国防科技大学优秀研究生创新资助项目（B100601）；湖南省优秀研究生创新资助项目（CX2010B026） |
|
| An Energy-efficient Multi-core Real-time Scheduling Algorithm Based on Dynamic Slack Reclamation |
| ZHANG Dongsong1, GUO Deke2, CHEN Fangyuan1, WU Tong3, Wu Fei4, JIN Shiyao1,5 |
|
(1.College of Computer, National Univ. of Defense Technology, Changsha 410073, China;2.Science and Technology on Information Systems Engineering Laboratory,National Univ. of Defense Technology, Changsha 410073, China;3.Center for National Security and Strategic Studies, National Univ. of Defense Technology, Changsha 410073, China;4.College of Electronic and Electrical Engineering,Shanghai Univ. of Engineering Science,Shanghai 201620,China;5.)
|
| Abstract: |
| In many embedded real-time systems, the actual execution time of tasks is usually less than their worst-case execution time (WCET), which produces lots of dynamic slack time. Based on this fact, we proposed an energy-efficient real-time scheduling algorithm LRE-DVFS-ALL for sporadic tasks deployed on multi-cores, which is based on optimal online scheduling algorithm LRE-TL. The main idea of the algorithm is to reclaim dynamic slack time, during which DVFS techniques can be used to reduce the execution frequency of future tasks to eliminate the energy consumption. Meanwhile, our algorithm also dynamically scales the voltage and frequency at the initial time of each TL plane and the release time of a sporadic task in each TL plane to guarantee the optimal schedulability of sporadic tasks. Systematic mathematical analysis and extensive simulation results show that LRE-DVFS-ALL can always save more energy than the existing algorithms when the total workload of the system exceeds a threshold, and it can also guarantees the optimal schedulability at the same time. |
| Keywords: real-time system energy-efficient scheduling multi-core dynamic slack time |
|
|
|
|
|
