北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2012, Vol. 35 ›› Issue (2): 117-120.doi: 10.13190/jbupt.201202.117.cheny

• 研究报告 • 上一篇    下一篇

非抢占式实时任务1次容错调度

陈勇1,2,3,林宝军1   

  1. 1中国科学院 光电研究院,北京 100190; 2中国科学院 研究生院, 北京 100190; 3北京国科环宇空间技术有限公司, 北京 100190
  • 收稿日期:2011-04-02 修回日期:2011-11-07 出版日期:2012-04-28 发布日期:2012-01-05
  • 通讯作者: 陈勇 E-mail:chenyongbj@163.com
  • 作者简介:陈勇(1978-),男,博士生,E-mail:chenyongbj@163.com 林宝军(1966-),男,教授,博士生导师
  • 基金资助:

    国家高技术研究发展计划项目(2008AA12A221)

Non-Preemptive Real-Time Task One-Fault-Tolerant Scheduling

CHEN Yong1,2,3,LIN Bao-jun1   

  1. 1The Academy of Optoelectronics Chinese Academy of Sciences, Beijing 100190, China; 2Graduate University of Chinese Academy of Science, Beijing 100190, China;3Beijing Universe of Chinese Academy of Science Space Technology Company limited, Beijing 100190, China
  • Received:2011-04-02 Revised:2011-11-07 Online:2012-04-28 Published:2012-01-05

摘要:

面向非抢占式任务实时调度问题,根据不同的故障间隔,推导出任务集合需要满足的条件. 根据任务的可重复执行次数,分别设计了非抢占式固定优先级容错(NP-FP-FT)以及动态优先级容错(NP-DP-FT)调度算法,并与非抢占式最早期限优先容错(NP-EDF-FT)、非抢占式单调速率容错(NP-RM-FT)调度算法进行了对比分析.结果显示,采用非抢占式固定优先级算法调度的任务集合具有最低的任务失效率.

关键词: 非抢占式, 实时, 容错, 调度

Abstract:

Aiming at the Non-preemptive task, the task schedule conditions are derived. Based on the task re-execute-time, the fixed priority and dynamic priority two kinds scheduling algorithm is designed. The performance of non-preemptive earliest-deadline-first fault-tolerant (NP-EDF-FT) non-preemptive rate-monotonic fault-tolerant (NP-RM-FT), non-preemptive fix priority fault tolerant (NP-FP-FT)and non-preemptive dynamic priority fault tolerant (NP-DP-FT)are analyzed as well. It is shown that the NP-FP-FT scheduling tasks have the lowest average invalidation rate.

Key words: non-preemptive, real-time, fault-tolerant, scheduling

中图分类号: