| EDF调度算法可调度性分析方法的改进研究 |
| |
| 引用本文： | 袁 暋,檀 明,周晶晶.EDF调度算法可调度性分析方法的改进研究[J].计算机应用研究,2013,30(8):2429-2431. |
| |
| 作者姓名： | 袁 暋 檀 明 周晶晶 |
| |
| 作者单位： | 1. 合肥学院 网络与智能信息处理重点实验室,合肥,230601
2. 合肥学院 网络与智能信息处理重点实验室,合肥 230601;合肥工业大学 计算机与信息学院,合肥 230009 |
| |
| 基金项目： | 国家自然科学基金资助项目（60873003, 60873195）; 安徽省教育厅自然科学一般项目（KJ2011B139） |
| |
| 摘 要： | 任务集的可调度性分析是实时系统研究和应用的关键问题。针对抢占式与不可抢占式EDF(earliest deadline first)调度算法, 分别给出了实时任务集新的可调度性测试条件, 针对任务集为可调度时可以实现快速判定。通过与已有的EDF算法的可调度性判定充要条件相结合, 提出了改进的抢占式与不可抢占式EDF算法的可调度性分析方法。仿真实验表明, 相对现有EDF算法的可调度性分析方法, 所提出的方法能有效提高算法性能。
|
| 关 键 词： | 实时系统 实时任务 抢占式EDF调度算法 不可抢占式EDF调度算法 可调度性分析方法 |
Research on improved schedulability analyzingmethod for tasks scheduled under EDF |
| |
| YUAN Min,TAN Ming,ZHOU Jing-jing.Research on improved schedulability analyzingmethod for tasks scheduled under EDF[J].Application Research of Computers,2013,30(8):2429-2431. |
| |
| Authors: | YUAN Min TAN Ming ZHOU Jing-jing |
| |
| Affiliation: | 1. Key Laboratory of Network & Intelligent Information Processing, Hefei University, Hefei 230601, China; 2. School of Computer & Information, Hefei University of Technology, Hefei 230009, China |
| |
| Abstract: | Schedulability analysis for real-time tasks set is a key problem in the research and application of real-time system. This paper gave two new conditions which could realize fast feasibility testing for real-time periodic tasks set scheduled under preemptive EDF(earliest deadline first) and non-preemptive EDF. It proposed improved schedulability analyzing algorithms for tasks scheduled under preemptive EDF and non-preemptive EDF. The simulation results show the advantages of the algorithms in terms of reducing the computing complexity compare to the existing schedulability analyzing algorithms. |
| |
| Keywords: | real-time system real-time task preemptive EDF scheduling algorithm non-preemptive EDF scheduling algorithm schedulability analyzing method |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用研究》浏览原始摘要信息 |
|
点击此处可从《计算机应用研究》下载全文 |
