现场硬实时网络调度算法研究

Study and Analysis of the Field Hard-Real-Time Networks Scheduling Algorithm

研究了实时任务死线不大于其周期的任务集调度条件与硬实时网络调度算法约束条件,论证了计算时间复杂度,并将单调死线调度方法直接用于非周期任务调度.最后对调度算法的可调度性进行了严格测试.

To meet scheduling condition of real-time tasks its characteristics of time are restricted in realtime systems. The real-time scheduling conditions are simplied when the people have studied this question. Scheduling condition and algorithm analysis of task sets are introduced, which task deadline was not less than its period. Slackening this restrict conditions, it adapted to scheduling of mixed model of period and no-period task. At the same time, scheduling restrict conditions of original RM algorithm is analyzed and shortcoming of computing time complexity is pointed out. Thus a new real-time scheduling approach and implementing flow-chart based on real-time networks scheduling algorithm is presented and given a strict contrast test of being put up real-time networks scheduling approach.