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

  • Authors:

  • Dong Liu;Weiyan Xing;Rui Li;Chunyuan Zhang;Haiyan Li

  • Affiliations:

  • 6 yuan 7 dui, Department of Computer, National University of Defense Technology, Changsha, Hunan 410073, China;China Huayin Ordnance Test Center, Huayin 714200, China;6 yuan 7 dui, Department of Computer, National University of Defense Technology, Changsha, Hunan 410073, China;6 yuan 7 dui, Department of Computer, National University of Defense Technology, Changsha, Hunan 410073, China;6 yuan 7 dui, Department of Computer, National University of Defense Technology, Changsha, Hunan 410073, China

  • Venue:
  • ICCS '07 Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007
  • Year:
  • 2007

Quantified Score

Hi-index 0.02

Visualization

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.