时间触发式以太网增量调度回溯算法研究

W. Gao, Borui Zhao, X. Mao
{"title":"时间触发式以太网增量调度回溯算法研究","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":"{\"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}","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

摘要

Time-triggered Ethernet由于节点故障迁移故障后,需要重新计算和调度已经迁移的消息。由于网络中存在已完成初始调度的消息,在对新增备份节点进行增量调度时,可能会出现调度冲突,导致解决失败。为了解决这一问题,本文提出了一种基于影响因子的分步增量调度回溯算法。当增量调度找不到可行解时,采用分步回溯策略。根据影响因子的大小,将非故障节点上的消息与现有待调度的消息一起进行消息增量调度规划。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Research on Incremental Scheduling Backtracking Algorithm for Time-triggered Ethernet
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Neurons identification of single-photon wide-field calcium fluorescent imaging data CTISC 2020 List Reviewer Page CTISC 2020 Commentary Image data augmentation method based on maximum activation point guided erasure Sponsors and Supporters: CTISC 2020
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1