计算机工程2017，Vol.43Issue(3)：57-61,68,6.DOI:10.3969/j.issn.1000-3428.2017.03.010
一种高回报的最小空闲时间优先实时调度改进算法
An Improved Least Slack First Real-time Scheduling Algorithmwith High Return
摘要
Abstract
Signal task scheduling algorithm is the key to the effectiveness of the implementation of Cyber Physical System(CPS).When the system is fully loaded,the Least Slack First(LSF) algorithm,Earliest Deadline First(EDF) algorithm or Highest Value First(HVF) algorithm cannot finish the task scheduling perfectly and the system energy consumption is higher than normal condition.Therefore,this paper proposes an improved scheduling algorithm.The algorithm can schedule system task dynamically by introducing task scheduling priority and actual task scheduling priority with combining task energy consumption,task completion value and task urgency.Experimental results show that for the same task set and the same number of tasks,the system energy consumption of the improved algorithm is less than that of LSF algorithm and EDF algorithm.When the system is fully loaded,compared with HVF algorithm,the improved algorithm can use less energy consumption to achieve the same total tasks' value.关键词
最小空闲时间优先算法/高回报最小空闲时间优先算法/任务能耗/任务价值/动态调度Key words
Least Slack First(LSF) algorithm/High Return Least Slack First(HRLSF) algorithm/task energy consumption/task value/dynamic scheduling分类
信息技术与安全科学引用本文复制引用
张晶,孙少杰,范洪博,肖智斌..一种高回报的最小空闲时间优先实时调度改进算法[J].计算机工程,2017,43(3):57-61,68,6.基金项目
国家自然科学基金(61562051) （61562051）
云南省应用基础研究计划重点项目(2014FA029). （2014FA029）
