Open AccessResearch on Time Triggered Ethernet Scheduling Planning Method
Author(s) -
Aodi Wei,
Guoqun Zhang,
Tāo Zhāng
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1518/1/012007
Subject(s) - computer science , scheduling (production processes) , fair share scheduling , distributed computing , dynamic priority scheduling , backtracking , real time computing , computer network , algorithm , mathematical optimization , mathematics , quality of service
Time-triggered Ethernet adds a time-triggered traffic type based on traditional event-triggered best-effort traffic, which extends data traffic into three communication formats, namely time-triggered (TT) messages and rate-constrained (RC) messages and the best-effort (BE) messages. Aiming at the time-triggered Ethernet message scheduling planning problem, this paper first introduces the principle of the SMT solver and the idea of the solver algorithm, and designs constraints for the message scheduling problem. Based on this, the paper introduces a load balancing strategy and a step-by-step iterative conflict backtracking method, designs and completes a time-triggered Ethernet message scheduling algorithm, and then completes scheduling planning for time-triggered traffic and optimization of scheduling results. For the planning results, the paper proposes verification indicators for network load balancing and algorithm solution efficiency, designs a test set for algorithm verification, completes algorithm analysis and verification based on the test set solution results, and determines the algorithm optimization effect.