Electronic Science and Technology ›› 2024, Vol. 37 ›› Issue (8): 84-91.doi: 10.16180/j.cnki.issn1007-7820.2024.08.012

Previous Articles     Next Articles

Real-Time Hybrid Task Scheduling Algorithm in Embedded Multicore System

LUO Guang, MAO Hang, ZHU Yangshuo, ZHANG Fengdeng   

  1. School of Optical-Electrical and Computer Engineering,University of Shanghaifor Science and Technology,Shanghai 200093,China
  • Received:2023-02-25 Online:2024-08-15 Published:2024-08-21
  • Supported by:
    National Natural Science Foundation of China(71840003);Shanghai Municipal Natural Science Fund Project(15ZR1429300)

Abstract:

In this study, an algorithm based on BFZL(Boundary Fair until Zero Laxit) is proposed to solve the problem of reasonable scheduling of real-time mixed task set formed by periodic task and sporadic task. Based on the I-BF(Improved Boundary Fair) real-time mixed task algorithm, the relaxation parameter of LLF(Least Laxity First) algorithm is introduced to improve the priority of decision task. A heuristic algorithm based on relaxation and heuristic strategy is proposed to improve task assignment strategy. The experimental results show that the BFZL algorithm can satisfy the real-time performance of the system and achieve the purpose of algorithm optimization. Through data comparative analysis, compared with the original algorithm, the proposed algorithm reduces the average response time of sporadic tasks by about 26%, reduces the context switch and migration by about 28% and 50%, respectively. Additionally, the algorithm also has advantages in scheduling overhead.

Key words: embedded system, multi-core processor, real-time scheduling, hybrid tasks, fair scheduling, fairness, divide, priority

CLC Number: 

  • TP316.2