Advertisement

A Fault-Tolerant Real-Time Scheduling Algorithm in Software Fault-Tolerant Module

  • Dong Liu
  • Weiyan Xing
  • Rui Li
  • Chunyuan Zhang
  • Haiyan Li
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4490)

Abstract

In software fault-tolerant module, the key issue that affects the performance of fault-tolerant scheduling algorithm is how to predict precisely whether a primary is executable. In order to improve the prediction precision, a new algorithm named DPA, Deep-Prediction based Algorithm, is put forward. DPA uses prediction-table to predict whether a primary can be completed before it is scheduled. Simulation results show that DPA provides more execution time for primaries and wastes less processor time than the well-known similar algorithms.

Keywords

scheduling algorithm software fault-tolerance real-time system 

References

  1. 1.
    Han, C.C., Shin, K.G., Wu, J.: A Fault-Tolerant Scheduling Algorithm for Real-Time Periodic Tasks with Possible Software Faults. IEEE Transactions on computers 52, 362–372 (2003)CrossRefGoogle Scholar
  2. 2.
    Han, J.J., Li, Q.H., Essa, A.A.: A dynamic Real-Time Scheduling Algorithm with Software Fault-Tolerance. Journal of Computer Research and Development 42, 315–321 (2005)CrossRefGoogle Scholar
  3. 3.
    Li, Q.H., Han, J.J., Essa, A.A., Zhang, W.: Dynamic scheduling algorithms with software fault-tolerance in hard real-time systems. Journal of Software 16, 101–107 (2005)MATHCrossRefGoogle Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Dong Liu
    • 1
  • Weiyan Xing
    • 2
  • Rui Li
    • 1
  • Chunyuan Zhang
    • 1
  • Haiyan Li
    • 1
  1. 1.6 yuan 7 dui, Department of Computer, National University of Defense Technology, Changsha, Hunan 410073China
  2. 2.China Huayin Ordnance Test Center, Huayin 714200China

Personalised recommendations