面向复杂任务集的任务调度算法  

Task Scheduling Algorithm for Complex Task Set

作　　者：高阳 盛德卫 文海 GAO Yang;SHENG De-wei;WEN Hai(Beijing Institute of Electronic System Engineering,Beijing 100854,China)

机构地区：[1]北京电子工程总体研究所

出　　处：《现代防御技术》2019年第3期162-168,共7页Modern Defence Technology

摘　　要：基于测控地检设备的显控软件需要同时处理测量解算、遥测帧解析、网络通信和遥测数据存储等多项任务。针对常规的任务调度算法无法适应设备显控软件复杂的任务集,提出了一种动态双优先级任务调度算法。算法在时间片轮转技术的基础上,综合考虑任务周期、相对截止期和剩余空闲时间3方面因素,对于硬实时和软实时周期任务提出不同的动态优先级计算策略,并针对引入剩余空闲时间导致的“颠簸”现象,提出一种抢占阈值的计算方法。理论分析和实测数据均证明该算法的优越性。Display control software based on test equipment in TT&C needs to deal with measurement solution,telemetry frame resolution,network communication and telemetry data store,and many other missions parallel. Aiming at the problem that the conventional algorithms lose pace with complex task set,a dynamic dual priority scheduling algorithm is put forward. Based on time slice rotation technology,the algorithm takes duty cycle,relative deadline and remaining idle time synthetically. Respective dynamic priority computing strategies are proposed in terms of hard real time and soft real time task. The preemption threshold computing method is presented towards the jolt from the remaining idle time. Both theoretical analysis and measured data authenticate the benefits of the dynamic dual priority scheduling algorithm.

关 键 词：测控地检设备 显控软件 任务集 调度算法 动态双优先级 抢占阈值 

分 类 号：TJ760.6[兵器科学与技术—武器系统与运用工程] TP301.6[自动化与计算机技术—计算机系统结构]