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

被引：0
|
作者：
Su X. [1 ]
Li Y. [2 ]
Zong N. [1 ]
Wei W. [3 ]
Li J. [1 ]
Ding Y. [1 ]
机构：
[1] 61623 PLA Troops, Beijing
[2] 61516 PLA Troops, Beijing
[3] College of Command Automation Beijing University of Aeronautics and Astronautics, Beijing
来源：
Tongxin Xuebao/Journal on Communications | 2020年 / 41卷 / 05期
关键词：
Degree of tightness; Degree of urgency; Multi-feature dynamic priority; Thrashing limit;
D O I：
10.11959/j.issn.1000-436x.2020091
中图分类号：
学科分类号：
摘要：
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. © 2020, Editorial Board of Journal on Communications. All right reserved.
引用
收藏
页码：159 / 167
页数：8
相关论文
共 14 条
  • [1] Semghouni S., Amanton L., Sade B., Et al., On new scheduling policy for the improvement of firm RTDBSs performances, Data & Knowledge Engineering, 63, 2, pp. 414-432, (2007)
  • [2] Muhuri P.K., Shukla K.K., Real-time scheduling of periodic tasks with processing times and deadlines as parametric fuzzy numbers, Applied Soft Computing, 9, 3, pp. 936-946, (2009)
  • [3] Nasser N., Nidal K., Lutful T., Et al., Dynamic multilevel priority packet scheduling scheme for wireless sensor network, IEEE Transactions on Wireless Communications, 12, 4, pp. 1448-1459, (2013)
  • [4] Benitez P.H., Benitez P.A., Ortega A.J., Et al., Networked control systems design considering scheduling restrictions and local faults, International Journal of Innovative Computing Information and Control, 8, 12, pp. 8515-8526, (2012)
  • [5] Hong X.Y., Zhang L., Yuan H., Real-time scheduling algorithm of Linux, Journal of South China University of Technology, 36, 4, pp. 104-109, (2008)
  • [6] Wang Y.Y., Wang Q., Wang H.A., Et al., A real-time scheduling algorithm on priority table and its implementation, Journal of Software, 15, 3, pp. 360-370, (2004)
  • [7] Chen H., Dynamic priority assignment strategy for real-time task, Journal of Chinese Computer Systems, 31, 7, pp. 1385-1388, (2010)
  • [8] Chen Z.Z., Xu S.C., Adaptive-parallelism scheduling for Internet-based volunteer computing system, Computer Engineering and Applications, 46, 21, pp. 86-89, (2010)
  • [9] Ba W., Research of real-time system dynamic priority assignment scheduling algorithm, (2010)
  • [10] Baurah S., Fisher N., The partitioned dynamic-priority scheduling of sporadic task systems, Real-Time Systems, 36, pp. 199-226, (2007)
12