摘要
针对消息数据的事件轮询机制设计各种性能优化算法对提高多功能车辆总线消息数据的实时性能具有重要作用.详细分析了消息数据的通信机制,给出了事件轮询的具体流程,通过引入仲裁二叉树模型,对事件轮询的核心算法即事件仲裁算法进行了深入解析.该模型涵盖了事件仲裁的各种情况,清晰的展示了事件仲裁的方向和特点.在此基础上,为减少因大量冲突导致的仲裁延时,提出平衡二叉树地址分配方式,相比协议中的连续地址分配方法,该地址分配方式通过合理分割冲突域,最大程度的减少了事件轮询的仲裁报文数量.仿真结果证明该分配方式有效缩短了仲裁时延,提高了MVB网络的实时性能.
According to the event polling mechanism of M VB message,the design of optimization performance plays an important role in improving the real-time performance of M VB message.The communication mechanism of M VB message is analyzed.A specific event polling process is given.By introducing the model of arbitration binary tree,we conduct an in-depth analysis on event arbitration algorithm which is the core algorithm of event polling.The model covers a variety of arbitration cases,clearly shows the direction and characteristics of the event arbitration.On this basis,in order to reduce the latency due to lots of conflicts,a balanced binary tree address allocation is proposed.Comparing with continuous address allocation of M VB,the proposed address allocation method can lead to the maximum reduction in the number of arbitration packets by breaking up the collision domain reasonably.Simulation results showthat the proposed allocation method effectively shortens the arbitration latency and the real-time performance of the M VB message is improved.
出处
《小型微型计算机系统》
CSCD
北大核心
2016年第4期799-802,共4页
Journal of Chinese Computer Systems
基金
国家自然科学基金项目(61273158)资助
湖南省研究生科研创新项目(CX2011B085)资助
关键词
多功能车辆总线
事件仲裁
仲裁二叉树
平衡二叉树
M ultifunction Vehicle Bus（MVB）
event arbitration
arbitration binary tree
balanced binary tree
