基于矩阵分解的TTE通信任务规划方法
详细信息    查看全文 | 推荐本文 |
  • 英文篇名:TTE communication task planning method based on matrix decomposition
  • 作者:连天野 ; 李峭 ; 熊华钢 ; 程子敬
  • 英文作者:Lian Tianye;Li Qiao;Xiong Huagang;Cheng Zijing;School of Electronic Information Engineering, Beihang University;State Key Laboratory of Space Ground Integrated Information Technology, Beijing Satellite Information Engineering Research Institute;
  • 关键词:实时通信 ; 矩阵分解 ; 严格周期 ; 时间触发
  • 英文关键词:real-time communication;;matrix decomposition;;strict cycle;;time triggered
  • 中文刊名:DZCL
  • 英文刊名:Electronic Measurement Technology
  • 机构:北京航空航天大学电子信息工程学院;北京卫星信息工程研究所信息技术国家重点实验室;
  • 出版日期:2019-03-23
  • 出版单位:电子测量技术
  • 年:2019
  • 期:v.42;No.314
  • 基金:国家自然科学基金(61073012、91538202);; 中央高校基本科研业务费(YWF-14-DZXY-018)项目资助
  • 语种:中文;
  • 页:DZCL201906022
  • 页数:5
  • CN:06
  • ISSN:11-2175/TN
  • 分类号:114-118
摘要
在航空航天电子领域,时间触发以太网(TTE)可以担当承载控制指令和实时数据的综合化网络,其中具有高关键性等级的通信任务采用时间触发(TT)通信。TT通信任务调度需要拓扑构型和路径选择等深化设计参数;然而,在设计的前期更关注应用层对于通信任务的要求,需要在不具备深化设计参数的条件下对TT通信任务进行规划。本文提出含有两个阶段的通信任务规划方法,首先将双次通信任务交换矩阵扩容为通信任务容量矩阵,随后引进并改进BVN分解方法,将后者分解非冲突通信任务组合的时间片,形成易于在后续调度过程中排布的模板。案例仿真研究表明,该规划方法可使通信任务延迟缩短43%,同时兼容后续时间调度表生成步骤。
        In the aerospace electronics field, time-triggered ethernet(TTE) can act as an integrated network for carrying control commands and real-time data, with time-triggered(TT) communications for missions with high critical levels. TT communication task scheduling requires deepening design parameters such as topology configuration and path selection; however, in the early stage of design, it pays more attention to the application layer requirements for communication tasks, and it is necessary to plan TT communication tasks without deepening design parameters. This paper proposes a two-stage communication task planning method. Firstly, the communication task switching matrix is expanded into a communication task capacity matrix. Then, the BVN decomposition method is introduced and improved, and the latter is decomposed into time slices of non-conflicting communication task combinations, which is easy to form. A template that is arranged during subsequent scheduling. Case study shows that the planning method can reduce the communication task delay by 43% and compatible with the subsequent time schedule generation step.
引文
[1]何锋.机载网络技术基础[M].国防工业出版社,2018.
    [2]WINDSOR J,HJORTNAES K.Time and space partitioning in spacecraft avionics[C].IEEE International Conference on Space Mission Challenges for Information Technology,IEEE Computer Society,2009.
    [3]LITTLEFIELD-LAWWILL J,KINNAN L.System considerations for robust time and space partitioning in integrated modular avionics[C].Digital Avionics Systems Conference,2008.
    [4]丁培丽.时间触发以太网关键技术研究与核心模块设计[D].杭州:浙江大学,2018.
    [5]汤宇,李峭,贾琪明.时间触发以太网的分布式任务负载均衡分配方法[J].计算机工程与设计,2014,35(5):1501-1505.
    [6]魏丰,潘小虎,曾勇,等.光纤CAN总线集线器及其组网研究[J].仪器仪表学报,2011,32(12):2839-2844.
    [7]AL SHEIKH A,BRUN O,HLADIK P E,et al.Strictly periodic scheduling in IMA-based architectures[J].RealTime Systems,2012,48(4):359-386.
    [8]SHEIKH A A,BRUN O,HLADIK P E,et al.A best-response algorithm for multiprocessor periodic scheduling[C].Euromicro Conference on Real-time Systems,IEEE Computer Society,2011:228-237.
    [9]STEINER W,BAUER G,HALL B,et al.TTEthernet:Time-Triggered Ethernet[M].In Time-Triggered Communication,CRC Press,2011.
    [10]Issuing Committee.S-2d2 Deterministic Ethernet And Unified Networking[S].SAE AS6802timetriggered ethernet.[2014-5-20].http://standards.sae.org/as6802/.
    [11]PRAKASH A,MOHIYUDDIN M,AZIZ A.Scheduling traffic matrices on general switch fabrics[C].HighPerformance Interconnects,14th IEEE Symposium on IEEE,2006:87-92.
    [12]DURKOVI'C S,CICA Z.Birkhoff-von Neumann switch with deflection based load balancing[C].Telecommunications Forum,IEEE,2017:1-4.
    [13]ELMENREICH W,IPP R.Introduction to TTP/C and TTP/A[J].Proceedings of the Workshop on Time,2003.
    [14]LIN J,ANSARI N.Enhanced Birkhoff-von Neumann decomposition algorithm for input queued switches[J].IEE Proceedings Communications,2001,148(6):339-342.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700