###
Journal of Software:2012.23(4):1010-1021

一种可行的分布式硬实时容错调度算法
朱萍,阳富民,涂刚,张杰,周正勇
(武汉纺织大学 数学与计算机学院, 湖北 武汉 430074;华中科技大学 计算机科学与技术学院, 湖北 武汉 430074)
Feasible Fault-Tolerant Scheduling Algorithm for Distributed Hard-Real-Time System
ZHU Ping,YANG Fu-Min,TU Gang,ZHANG Jie,ZHOU Zheng-Yong
(College of Mathematics and Computer Science, Wuhan Textile University, Wuhan 430074, China;School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China)
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 3400   Download 3269
Received:June 18, 2010    Revised:December 09, 2010
> 中文摘要: 针对分布式硬实时系统发生处理机故障后,当前周期内的任务实例和后续实例相对截止期限的不同紧迫程度,提出非紧迫周期内延迟策略——DNUP(delay in non-urgent period).该策略能够尽可能地推迟非紧迫实例的执行,使得低优先级实例有更多的机会完成其紧迫周期内的执行,从而实现处理器空闲(slack)资源的合理挪动.仿真实验结果表明,与其他几个著名的分布式容错调度算法相比,DNUP 策略能够提高任务的可调度性,从而有效减少了所需处理机的数目.
中文关键词: 实时  分布式系统  调度  容错  优先级
Abstract:In distributed hard-real-time systems, when a hardware failure occurs, the task instance in current period is usually more urgent than the subsequent ones. According to this, a novel strategy of delay in non-urgent period (referred to as DNUP) is proposed. DNUP strategy can postpone the execution of non-urgent instance as late as possible and reserve the slack time for the instance with low priority. Thus it has a better chance to complete its execution in an urgent period. Extensive simulations reveal that DNUP can improve the schedulability of periodic tasks and achieve a remarkable saving on the number of processors required with respect to several well-known fault-tolerant scheduling algorithms.
文章编号:     中图分类号:    文献标志码:
基金项目:国家自然科学基金(60603032) 国家自然科学基金(60603032)
Foundation items:
Reference text:

朱萍,阳富民,涂刚,张杰,周正勇.一种可行的分布式硬实时容错调度算法.软件学报,2012,23(4):1010-1021

ZHU Ping,YANG Fu-Min,TU Gang,ZHANG Jie,ZHOU Zheng-Yong.Feasible Fault-Tolerant Scheduling Algorithm for Distributed Hard-Real-Time System.Journal of Software,2012,23(4):1010-1021