基于CAN总线的自动刨煤机组监控网络动态调度研究  

Research on Scheduling of Automatic Plough Group CAN-Bus with Least Laxity First Technique

作　　者：郝刚[1] 

机构地区：[1]煤炭科学研究总院沈阳研究院

出　　处：《电气技术》2010年第7期49-52,共4页Electrical Engineering

摘　　要：当前自动刨煤机组监控CAN网络采用静态优先级调度,随着系统交换数据的增加,现有的CAN总线带宽资源愈显不足,监控实时数据通讯的可靠性、安全性将受到影响,本文引入最小松弛优先(LLF)动态调度算法,针对在CAN总线中应用LLF算法时有限的CAN帧标识符位难以实现信息松弛编码及各节点需要严格的时间同步等问题,提出了基于总线仲裁的LLF算法,介绍了LLF调度算法原理及可调度性分析方法,最后将该调度算法应用于刨煤机组控制系统信息通信调度,验证了其调度算法的可行性,通过对比固定优先级截止期单调算法调度,验证了LLF算法良好的调度性能。Scheduling automatic plough group(APG) CAN bus with static strategy bring lower the bus utilization, which will affect the dependability and safety of messages in system, dynamic schedule strategies can bring higher resource utilization then static ones, while technique such as least laxity first (LLF) scheduling can hardly be applied to CAN bus because the scope of laxity of messages are too large while the bit sizes in CAN frame identifier is limited,and it is difficult to guarantee strict time synchronization in all nodes. To solve these problems, a new LLF algorithm based on CAN bus arbitration is proposed, the principle of LLF and schedulability analysis was given. Finally the LLF is used to schedule AGP monitor and control system by compare with deadline monotonic(DM) algorithm, the scheduling result verifies the proposed LLF is feasible, and has perfect performance.

关 键 词：控制器局域网总线 最小松弛优先 动态调度 自动刨煤机组 

分 类 号：TD632.1[矿业工程—矿山机电]