Journal on Communications ›› 2020, Vol. 41 ›› Issue (5): 159-167.doi: 10.11959/j.issn.1000-436x.2020091

• Papers • Previous Articles     Next Articles

Network real-time scheduling algorithm based on multi-feature dynamic priority

Xun SU1,Yanfang LI2,Ning ZONG1,Wei WEI3,Juan LI1,Ying DING1   

  1. 1 61623 PLA Troops,Beijing 100036,China
    2 61516 PLA Troops,Beijing 100074,China
    3 College of Command Automation Beijing University of Aeronautics and Astronautics,Beijing 100088,China
  • Revised:2020-04-14 Online:2020-05-25 Published:2020-05-30

Abstract:

Real-time task scheduling system structure and task model were proposed aiming at the network real-time scheduling problem.The task degree of urgency was defined by considering the deadline of task,execution time and interval time between works.The task degree of tightness was proposed based on service-level assurance,according to functional importance of different tasks in the real-time task scheduling system.The thrashing limit for avoiding task switching frequently was acquired through dynamic regulation to task priorities by degree of urgency and degree of tightness,which guaranteed the success rate of tasks execution and utilization ratio of client execution.Test simulation results suggest that the multi-feature dynamic priority scheduling strategy improves the success rate of task scheduling and shorten the average response time,which suggests it has obvious superiority compared with BE and EDF scheduling algorithm.

Key words: multi-feature dynamic priority, degree of urgency, degree of tightness, thrashing limit

CLC Number: 

No Suggested Reading articles found!