{"title":"Research on Incremental Scheduling Backtracking Algorithm for Time-triggered Ethernet","authors":"W. Gao, Borui Zhao, X. Mao","doi":"10.1109/CTISC49998.2020.00019","DOIUrl":null,"url":null,"abstract":"After Time-triggered Ethernet migrates faults due to node failure, it is necessary to recalculate and schedule the messages that have been migrated. Because there are messages that have completed initial scheduling in the network, scheduling conflicts may occur in incremental scheduling of newly added backup nodes, resulting in failure of solution. In order to solve this problem, this paper proposes a step-by-step incremental scheduling backtracking algorithm based on impact factor. If the incremental scheduling does not find a feasible solution, the strategy of step-by-step backtracking is adopted. According to the size of the impact factor, the messages on the non fault nodes and the message incremental scheduling planning is carried out together with the existing messages to be scheduled.","PeriodicalId":266384,"journal":{"name":"2020 2nd International Conference on Advances in Computer Technology, Information Science and Communications (CTISC)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 2nd International Conference on Advances in Computer Technology, Information Science and Communications (CTISC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CTISC49998.2020.00019","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
After Time-triggered Ethernet migrates faults due to node failure, it is necessary to recalculate and schedule the messages that have been migrated. Because there are messages that have completed initial scheduling in the network, scheduling conflicts may occur in incremental scheduling of newly added backup nodes, resulting in failure of solution. In order to solve this problem, this paper proposes a step-by-step incremental scheduling backtracking algorithm based on impact factor. If the incremental scheduling does not find a feasible solution, the strategy of step-by-step backtracking is adopted. According to the size of the impact factor, the messages on the non fault nodes and the message incremental scheduling planning is carried out together with the existing messages to be scheduled.