面向网络传输的时分任务调度算法

来源 :信息与控制 | 被引量 : 0次 | 上传用户:woshixiaomihu
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
针对传统时分调度以太网中存在的数据包排队时延问题,提出了时分任务调度算法.传统时分调度以太网仅在网络传输过程中通过对时隙的调度来避免数据碰撞,由于不能控制数据包的生成时间,通常会存在排队时延.本文则从任务执行层面考虑,将数据包生成过程与传输过程相结合,通过对网络节点任务执行时间和数量的优化与调度,来控制数据包的生成时间,保证每个数据包生成后可以立即进行数据传输,解决了排队时延和数据碰撞的问题,提高了控制系统的实时性能.提出的算法可以使网络中的节点在不修改网络协议或增加硬件设备的情况下,仅通过对各节点的任务调度即可实现具有时隙效果的网络传输,具有更低的任务时延.仿真结果证明了该算法的可行性、有效性和优越性. Aiming at the problem of packet queuing delay existing in traditional time-division scheduling Ethernet, a time-sharing task scheduling algorithm is proposed.Traditional time-division scheduling Ethernet only avoids data collision by scheduling the time slot in network transmission process, The queuing delay usually exists.This paper combines the data packet generation process and transmission process from task execution level to control the generation of data packets by optimizing and scheduling the task execution time and number of network nodes Time to ensure that each data packet can be generated immediately after the data transfer to solve the problem of queuing delay and data collision and improve the real-time performance of the control system.The proposed algorithm can make the nodes in the network without modifying the network protocol or increase In the case of hardware equipment, the network transmission with time-slot effect can be realized only by scheduling the tasks of each node with lower task delay.The simulation results show the feasibility, effectiveness and superiority of the algorithm.
其他文献