| 非抢占式实时任务1次容错调度 |
| |
| 引用本文： | 陈勇,林宝军.非抢占式实时任务1次容错调度[J].北京邮电大学学报,2012,35(2):117-120. |
| |
| 作者姓名： | 陈勇 林宝军 |
| |
| 作者单位： | 中国科学院光电研究院,北京100190;中国科学院研究生院,北京100190;北京国科环宇空间技术有限公司,北京100190;中国科学院光电研究院,北京,100190 |
| |
| 基金项目： | 国家高技术研究发展计划项目(2008AA12A221) |
| |
| 摘 要： | 面向非抢占式任务实时调度问题,根据不同的故障间隔,推导出任务集合需要满足的条件.根据任务的可重复执行次数,分别设计了非抢占式固定优先级容错(NP-FP-FT)以及动态优先级容错(NP-DP-FT)调度算法,并与非抢占式最早期限优先容错(NP-EDF-FT)、非抢占式单调速率容错(NP-RM-FT)调度算法进行了对比分析.结果显示,采用非抢占式固定优先级算法调度的任务集合具有最低的任务失效率.
|
| 关 键 词： | 非抢占式 实时 容错 调度 |
| 收稿时间： | 2011-04-02 |
Non-Preemptive Real-Time Task One-Fault-Tolerant Scheduling |
| |
| CHEN Yong
,
LIN Bao-jun.Non-Preemptive Real-Time Task One-Fault-Tolerant Scheduling[J].Journal of Beijing University of Posts and Telecommunications,2012,35(2):117-120. |
| |
| Authors: | CHEN Yong LIN Bao-jun |
| |
| Affiliation: | 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 |
| |
| 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. |
| |
| Keywords: | non-preemptive real-time fault-tolerant scheduling |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《北京邮电大学学报》浏览原始摘要信息 |
|
点击此处可从《北京邮电大学学报》下载全文 |
|
