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

可重构系统中实时任务容错调度算法
引用本文:殷进勇,顾国昌,吴艳霞. 可重构系统中实时任务容错调度算法[J]. 计算机应用研究, 2009, 26(5): 1729-1732
作者姓名:殷进勇  顾国昌  吴艳霞
作者单位:哈尔滨工程大学,计算机科学与技术学院,哈尔滨,150001;哈尔滨工程大学,计算机科学与技术学院,哈尔滨,150001;哈尔滨工程大学,计算机科学与技术学院,哈尔滨,150001
摘    要:现在FPGA已被广泛的应用,但三模冗余(TMR)结构不能充分利用FPGA资源,基于主/从版本技术,提出一种实时任务容错调度算法。算法通过后向调度从版本,使得从版本在其截止期限内尽可能地推迟执行,从而同一任务的主从版本在执行时间上没有重叠或较少重叠,当任务主版本成功执行时释放任务从版本所占用的资源。仿真实验表明,与TMR相比,此方法能更有效地利用FPGA资源,提高硬件任务的接受率。

关 键 词:可重构计算  实时调度  容错调度  放置策略

Fault-tolerant scheduling algorithm of real-time tasks for reconfigurable system
YIN Jin-yong,GU Guo-chang,WU Yan-xia. Fault-tolerant scheduling algorithm of real-time tasks for reconfigurable system[J]. Application Research of Computers, 2009, 26(5): 1729-1732
Authors:YIN Jin-yong  GU Guo-chang  WU Yan-xia
Affiliation:(College of Computer Science & Technology, Harbin Engineering University, Harbin 150001, China)
Abstract:FPGA has been used widely now, but the architecture of TMR(triple module redundancy) can not make full use of FPGA. This paper proposed a fault-tolerant scheduling algorithm of hardware real-time tasks based on primary/slave copy. By scheduled backwards, the salve copy executed as late as possible before its deadline. So that the primary copy had no overlap or as small overlap as possible with the slave copy on the executing time. When the primary copy executed successfully, released the slave copy. The result of experiment demonstrates that the method can use the FPGA more efficiently than TMR and the accept ratio of hardware tasks increases.
Keywords:reconfigurable computing   real-time scheduling   fault-tolerant scheduling   placement scheme
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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