首页 | 本学科首页   官方微博 | 高级检索  
     检索      

非周期实时任务过载的判别和处理机制
引用本文:吴悦,唐立三,杨洪斌.非周期实时任务过载的判别和处理机制[J].应用科学学报,2009,27(2):198-202.
作者姓名:吴悦  唐立三  杨洪斌
作者单位:上海大学计算机工程与科学学院,上海200072
基金项目:上海市重点学科建设项目 
摘    要:提出一种基于任务价值的非周期实时任务过载处理机制. 在给出一种非周期实时任务过载判断方法的基础上,将任务的截止期和价值这两个参数结合起来,提出处理实时任务过载的数学模型,并采用改进的动态贪婪算法求解. 设计了任务参数和任务价值函数,从实现价值率方面分析改进的动态贪婪算法的性能. 实验结果表明,在所有额定负载条件下,改进的动态贪婪算法相对于截止期优先、最高价值优先和鲁棒最高价值优先等算法能达到更高的实现价值率.

关 键 词:实时任务过载  非周期任务  动态背包  贪婪算法  
收稿时间:2008-04-16
修稿时间:2008-10-23

Judgement and Mechanism of Handling on Aperiodic Real-Time Task Overload
WU Yue,TANG Li-san,YANG Hong-bin.Judgement and Mechanism of Handling on Aperiodic Real-Time Task Overload[J].Journal of Applied Sciences,2009,27(2):198-202.
Authors:WU Yue  TANG Li-san  YANG Hong-bin
Institution:School of Computer Engineering and Science, Shanghai University, Shanghai 200072, China
Abstract:A real-time aperiodic task overload handling mechanism based on value of task is presented in this paper. A method of verifying task overload is first presented. A mathematical model termed dynamic constraint knapsack model is established by combining two parameters, deadline and value of task. An enhanced dynamic greed algorithm (EDGA) is then presented to handle the model. By determining parameters and the value function of tasks, performance of EDGA is analyzed in terms of hit value ratio. Experimental results show that EDGA can achieve higher hit value ratio compared to the earliest deadline first (EDF), highest value first (HVF) and robust highest value first (RHVF) algorithms under all workload conditions.
Keywords:real-time tasks overload  aperiodic task  dynamic knapsack  greedy algorithm  
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《应用科学学报》浏览原始摘要信息
点击此处可从《应用科学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号