Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2012, Vol. 35 ›› Issue (2): 117-120.doi: 10.13190/jbupt.201202.117.cheny

• Reports • Previous Articles     Next Articles

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

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

CLC Number: