容错优先级可提升的抢占阈值容错调度算法
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

基金项目:

国家科技重大专项(2009ZX04009-022)


Preemption Threshold Scheduling Algorithm with Higher Fault-Tolerant Priority
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    基于软件容错模型,提出了允许容错优先级提升的抢占阈值容错调度算法(extended fault-tolerant fixed-priority with preemption threshold, 简称FT-FPPT*). 该算法能够在抢占式容错调度算法(fault-tolerant fixed-priority preemptive, 简称FT-FPP)和抢占阈值容错调度算法(fault-tolerant fixed-priority with preemption threshold,简称FT-FPP

    Abstract:

    Based on the worst-case response time (WCRT) schedulability analysis for hard real-time systems, a new scheduling algorithm called extended fault-tolerant fixed-priority with preemption threshold (FT-FPPT*) is proposed in the software fault-tolerant model. This algorithm can be used, together with the schedulability analysis, to effectively enhance the fault-tolerant capability when the traditional fault-tolerant fixed-priority preemptive (FT-FPP) scheduling and fault-tolerant fixed-priority scheduling with preemption threshold (FT-FPPT) are no longer appropriate. At length, an optimal priority assignment search algorithm (PASA) is presented. PASA is optimal in the sense that the fault resilience of task sets is maximized for the proposed analysis. The effectiveness of the proposed approach is also evaluated by simulation.

    参考文献
    相似文献
    引证文献
引用本文

丁万夫,郭锐锋,秦承刚,刘娴,郭凤钊.容错优先级可提升的抢占阈值容错调度算法.软件学报,2011,22(12):2894-2904

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2010-01-22
  • 最后修改日期:2010-07-28
  • 录用日期:
  • 在线发布日期:
  • 出版日期:
您是第位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号