The Research of Scheduling Algorithm Based on Time-Triggered Ethernet

This Time-triggered Ethernet (TTE) is a valid manner to ensure the timeliness, reliability and accuracy of time-triggered (TT) messages which make up for the shortcomings of traditional Ethernet. Satisfiability Modulo Theories (SMT) is the main theory to generate the traditional TTE schedule. However, the calculation time of SMT is too long when the number of time-triggered messages is large. To solve the problem, bin-packing algorithm is applied to the scheduling problem. This paper aims to optimize and improve the bin-packing algorithm including the packing rules and empty box design method based on the principle of the two-staged bin-packing algorithm. With the improved algorithm we proposed, it can ensure the feasibility and porosity of scheduling table. Additionaly, it can also improves the transmission performance of event-triggered (ET) messages without affecting TT messages transmission. The simulation results show that the improved algorithm reduces the latency of the ET messages and greatly shortens the calculation time of the scheduling algorithm.