A Feasible Schedulability Analysis for Fault-Tolerant Real-Time Systems
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Based on the worst-case response time schedulability analysis for fault-tolerant real-time systems, a new fault-tolerant priority assignment algorithm is proposed. This algorithm can be used, together with the schedulability analysis, to effectively improve system fault resilience when the two traditional fault-tolerant priority assignment policies can’t improve system fault resilience. A fault-tolerant priority configuration search algorithm is also presented for the proposed analysis. The effectiveness of the proposed approach is evaluated by simulation.

    Reference
    Related
    Cited by
Get Citation

李俊,阳富民,卢炎生.一种可行的容错实时系统可调度性分析.软件学报,2005,16(8):1513-1522

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:February 25,2004
  • Revised:March 03,2005
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063