{"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}
引用次数: 0
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.
期刊介绍:
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.