通信学报 ›› 2020, Vol. 41 ›› Issue (5): 159-167.doi: 10.11959/j.issn.1000-436x.2020091

• 学术论文 • 上一篇    下一篇

基于多特征动态优先级的网络实时调度算法

苏洵1,李艳芳2,宗宁1,魏巍3,李娟1,丁莹1   

  1. 1 61623部队,北京 100036
    2 61516部队,北京 100074
    3 北京航空航天大学机械工程及自动化学院,北京 100088
  • 修回日期:2020-04-14 出版日期:2020-05-25 发布日期:2020-05-30
  • 作者简介:苏洵(1965- ),女,北京人,61623 部队正高级工程师,主要研究方向为数据通信、计算机网络建设规划、运维管理及性能优化、数据中心建设规划及运维管理等|李艳芳(1973- ),女,湖北武汉人,61516部队高级工程师,主要研究方向为计算机网络运维管理、网络性能优化、信息服务|宗宁(1980- ),女,山东济宁人,61623部队高级工程师,主要研究方向为计算机网络运维、网络性能优化、信息服务等|魏巍(1982- ),男,辽宁沈阳人,博士,北京航空航天大学副教授、博士生导师,主要研究方向为智能制造技术及应用|李娟(1979- ),女,河北固安人,61623部队工程师,主要研究方向为计算机网络运维管理、网络性能优化、信息服务、物联网等|丁莹(1981- ),女,山东沾化人,61623部队工程师,主要研究方向为计算机网络运维、网络性能优化、信息服务等

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

摘要:

针对网络实时调度问题,提出实时调度系统体系结构与任务模型。综合考虑任务截止期、执行时间及间隔时间等属性,定义任务迫切度;根据不同任务的重要程度,提出基于服务质量的任务松紧度。通过迫切度和松紧度对优先级的动态调节,得到防止任务频繁切换的颠簸限度,保证了任务执行成功率与客户端资源利用率。仿真实验结果表明,与调度尽力交付(BE)算法、最早截止时间优先(EDF)算法相比,基于多特征动态优先级的网络实时调度算法提高了任务调度成功率,缩短了平均响应时间。

关键词: 多特征动态优先级, 迫切度, 松紧度, 颠簸限度

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

中图分类号: 

No Suggested Reading articles found!