An imporosity message scheduling based on modified genetic algorithm for time-triggered Ethernet  

作　　者：Yingjing ZHANG Feng HE Guangshan LU Huagang XIONG 

机构地区：[1]School of Electronic and Information Engineering, Beihang University

出　　处：《Science China(Information Sciences)》2018年第1期275-277,共3页中国科学（信息科学）（英文版）

基　　金：supported by National Natural Science Foundation of China (Grant Nos. 61301086, 20131951027);China Scholarship Council

摘　　要：Dear editor,In time-triggered Ethernet（TTEthernet）,there are three kinds of messages which are timetriggered（TT）,rate-constrained（RC）and besteffort（BE）messages.In general,TTEthernet scheduling can be considered to be a multiresources scheduling,which is proven to be a non-deterministic polynomial（NP）complete problem.Dear editor,In time-triggered Ethernet（TTEthernet）,there are three kinds of messages which are timetriggered（TT）,rate-constrained（RC）and besteffort（BE）messages.In general,TTEthernet scheduling can be considered to be a multiresources scheduling,which is proven to be a non-deterministic polynomial（NP）complete problem.

关 键 词：An imporosity message scheduling modified genetic algorithm for time-triggered Ethernet 

分 类 号：TP4[自动化与计算机技术]