Electronic Science and Technology ›› 2025, Vol. 38 ›› Issue (1): 73-80.doi: 10.16180/j.cnki.issn1007-7820.2025.01.010

Previous Articles     Next Articles

Fault-Tolerant Real-Time Scheduling Algorithm in Multi-Core Processor

ZHU Yangshuo, LÜ Haiyu, LI Yichen, ZHANG Fengdeng()   

  1. School of Optical Electrical and Computer Engineering,University of Shanghai for Science and Technology,Shanghai 200093,China
  • Received:2023-05-28 Revised:2023-06-30 Online:2025-01-15 Published:2025-01-06
  • Supported by:
    National Natural Science Foundation of China(71840003);Natural Science Foundation of Shanghai(15ZR1429300)

Abstract:

In view of the problems such as too many times of rejected tasks and waste of resources in fault-tolerant fair scheduling FT-FS(Fault Tolerate Fair Scheduler) algorithm, a new fair scheduling algorithm PA-FTFS(Primary-Alternate and Fault Tolerant Fair Scheduling) is proposed based on FT-FS algorithm by integrating the main/alternative PA(Primary Alternate) fault-tolerant strategy. This algorithm can reduce the number of rejected tasks in multi-core processor system and reduce the waste of resources. MATLAB simulation software is used to verify the above algorithms. The experimental results show that PA-FTFS algorithm using proportional replacement task strategy has significantly reduced the number of task rejection times compared with FT-FS algorithm after permanent kernel failure. Data analysis shows that PA-FTFS algorithm has better failure rate and scheduling rate than FT-FS algorithm.

Key words: multi-core processor, failure, fault tolerance, fair dispatch, main/alternative version, reject tasks, alternative tasks, MATLAB simulation

CLC Number: 

  • TP316