{"title":"基于信息素重置策略的车载信息调度最小延迟优化","authors":"Junqiang Jiang, Lunxin Xie, Duqun Zhou, Bo Fan","doi":"10.1109/SmartWorld-UIC-ATC-ScalCom-DigitalTwin-PriComp-Metaverse56740.2022.00298","DOIUrl":null,"url":null,"abstract":"In-vehicle applications generally have latency requirements; serious safety accidents will likely be caused due to the applications failing to take the correct actions within a specified time frame. In this study, a Pheromone Resetting Ant Colony Optimization (PRACO) algorithm is proposed to address the calculation of the minimum response time of an application whose messages are transmitted by using the Controller Area Network with flexible data rates (CAN FD) bus. A Random Popup (RP) algorithm is equipped in PRACO to quickly obtain the valid message sequence, followed by resetting the pheromones on all paths if ants find a new optimal valid message sequence path. The minimum response delay of an in-vehicle application can be further got through a continuous iterative search and pheromone update. A Directed Acyclic Graph (DAG) workflow scheduling example and an Adaptive Cruise Control (ACC) application are used to conduct the simulation experiment. The results show that our PRACO algorithm significantly outperforms other static scheduling algorithms in obtaining the lowest response latency.","PeriodicalId":43791,"journal":{"name":"Scalable Computing-Practice and Experience","volume":"1 1","pages":"2061-2068"},"PeriodicalIF":0.9000,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Minimum Delay Optimization for Message Scheduling in In-Vehicle Applications Based on Pheromone Resetting Strategy\",\"authors\":\"Junqiang Jiang, Lunxin Xie, Duqun Zhou, Bo Fan\",\"doi\":\"10.1109/SmartWorld-UIC-ATC-ScalCom-DigitalTwin-PriComp-Metaverse56740.2022.00298\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In-vehicle applications generally have latency requirements; serious safety accidents will likely be caused due to the applications failing to take the correct actions within a specified time frame. In this study, a Pheromone Resetting Ant Colony Optimization (PRACO) algorithm is proposed to address the calculation of the minimum response time of an application whose messages are transmitted by using the Controller Area Network with flexible data rates (CAN FD) bus. A Random Popup (RP) algorithm is equipped in PRACO to quickly obtain the valid message sequence, followed by resetting the pheromones on all paths if ants find a new optimal valid message sequence path. The minimum response delay of an in-vehicle application can be further got through a continuous iterative search and pheromone update. A Directed Acyclic Graph (DAG) workflow scheduling example and an Adaptive Cruise Control (ACC) application are used to conduct the simulation experiment. The results show that our PRACO algorithm significantly outperforms other static scheduling algorithms in obtaining the lowest response latency.\",\"PeriodicalId\":43791,\"journal\":{\"name\":\"Scalable Computing-Practice and Experience\",\"volume\":\"1 1\",\"pages\":\"2061-2068\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2022-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Scalable Computing-Practice and Experience\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SmartWorld-UIC-ATC-ScalCom-DigitalTwin-PriComp-Metaverse56740.2022.00298\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Scalable Computing-Practice and Experience","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SmartWorld-UIC-ATC-ScalCom-DigitalTwin-PriComp-Metaverse56740.2022.00298","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0
摘要
车载应用程序通常有延迟要求;如果应用程序没有在规定的时间内采取正确的行动,可能会造成严重的安全事故。本文提出了一种信息素重置蚁群优化算法(Pheromone reset Ant Colony Optimization,简称PRACO),以解决使用灵活数据速率控制器局域网(CAN FD)总线传输信息的应用程序的最小响应时间计算问题。该算法采用随机弹出(Random Popup, RP)算法,快速获取有效信息序列,当蚂蚁找到新的最优有效信息序列路径时,重置所有路径上的信息素。通过连续迭代搜索和信息素更新,进一步得到车载应用的最小响应延迟。利用有向无环图(DAG)工作流调度实例和自适应巡航控制(ACC)应用程序进行了仿真实验。结果表明,该算法在获得最低响应延迟方面明显优于其他静态调度算法。
Minimum Delay Optimization for Message Scheduling in In-Vehicle Applications Based on Pheromone Resetting Strategy
In-vehicle applications generally have latency requirements; serious safety accidents will likely be caused due to the applications failing to take the correct actions within a specified time frame. In this study, a Pheromone Resetting Ant Colony Optimization (PRACO) algorithm is proposed to address the calculation of the minimum response time of an application whose messages are transmitted by using the Controller Area Network with flexible data rates (CAN FD) bus. A Random Popup (RP) algorithm is equipped in PRACO to quickly obtain the valid message sequence, followed by resetting the pheromones on all paths if ants find a new optimal valid message sequence path. The minimum response delay of an in-vehicle application can be further got through a continuous iterative search and pheromone update. A Directed Acyclic Graph (DAG) workflow scheduling example and an Adaptive Cruise Control (ACC) application are used to conduct the simulation experiment. The results show that our PRACO algorithm significantly outperforms other static scheduling algorithms in obtaining the lowest response latency.
期刊介绍:
The area of scalable computing has matured and reached a point where new issues and trends require a professional forum. SCPE will provide this avenue by publishing original refereed papers that address the present as well as the future of parallel and distributed computing. The journal will focus on algorithm development, implementation and execution on real-world parallel architectures, and application of parallel and distributed computing to the solution of real-life problems.