多处理器实时系统容错ICDM调度算法  

A Fault-Tolerant ICDM Scheduling Algorithm for Multiprocessor Real-Time Systems

作　　者：周悦[1] 尹金玲[1] 

机构地区：[1]沈阳建筑大学信息与控制工程学院,辽宁沈阳110168

出　　处：《沈阳建筑大学学报（自然科学版）》2006年第6期1019-1022,共4页Journal of Shenyang Jianzhu University：Natural Science

基　　金：辽宁省博士启动基金(20041002);辽宁省教育厅基金(2004F044)

摘　　要：目的提出一种针对多处理器实时系统中具有时间、资源和容错需求任务的调度算法来满足硬实时系统实时性及可靠性要求.使硬实时系统在发生故障的情况下,任务也能在其截止期内完成,不致产生灾难性后果.方法将非精确计算模型引入到Dis-tance Myopic算法中,通过非精确计算模型与Distance Myopic算法的有效结合,提出ICDM算法.结果任务分为主副两个版本,每个任务都由两部分组成:强制执行部分和选择执行部分;当任务强制执行部分不能达到截止期时,通过调用MOPT算法减小前序任务选择部分的执行时间,使其满足截止期要求.ICDM算法使任务在保证结果可接受的情况下,在其截止期内完成,提高了任务的可调度性.结论通过引入非精确计算模型,使算法的可调度性增强了,也提高了硬实时系统的实时性及可靠性.The scheduling algorithm for the tasks in multiprocessor real-time systems which have timing, resource and fault-tolerant constraints is presented, by which in hard real-time system the problem of reliability and timing is solved. In muhiprocessor real-time systems, in the presence of hardware component failures, tasks can be executed in their deadline. Systems can not make serious results. Imprecise computational model is applied to Distance Myopic algorithm. ICDM algorithm is presented. Every task has two editions： preceding edition and back edition, every task has two portions： mandatory portion and optional portion. When the mandatory portion of a task is not finished, ICDM algorithm quotes MOPT algorithm to minish the optional portion time of foreword tasks to meet the deadline. ICDM algorlthm improves feasibility of task scheduling and obtains acceptable results. The scheduling feasibility of algorithm, timing and reliability of real-tlme system are improved by introducing imprecise computational model.

关 键 词：实时系统 ICDM算法 容错调度算法 非精确模型 MOPT算法 

分 类 号：TP13[自动化与计算机技术—控制理论与控制工程]