Alexy Torres Aurora Dugo, Jean-Baptiste Lefoul, Aymen Ben-Salem, Serge Harnois, F. Magalhães, G. Nicolescu
{"title":"安全关键系统的高效调度、映射和内存带宽分配","authors":"Alexy Torres Aurora Dugo, Jean-Baptiste Lefoul, Aymen Ben-Salem, Serge Harnois, F. Magalhães, G. Nicolescu","doi":"10.1109/NEWCAS52662.2022.9842219","DOIUrl":null,"url":null,"abstract":"In safety-critical multi-core architectures, isolation becomes more challenging as multiple components are shared between the cores, which generates delays in execution time called interferences. To reduce buses contention, it is important to limit the bandwidth allocated to each application. Current state-of-the-art solutions for bus budgeting allocation are not scalable and do not provide the correct level of flexibility to model complex systems. To cope with these challenges, we propose a novel heuristic to generate the schedule, mapping and bus budget allocation. We achieve scalable execution times up to 45 times faster compared to the state of the art. We further introduce real-life constraints such as application dependencies, forced mapping and release time. Compared to the state of the art, our approach is applicable in complex systems.","PeriodicalId":198335,"journal":{"name":"2022 20th IEEE Interregional NEWCAS Conference (NEWCAS)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Efficient Scheduling, Mapping and Memory Bandwidth Allocation for Safety-Critical Systems\",\"authors\":\"Alexy Torres Aurora Dugo, Jean-Baptiste Lefoul, Aymen Ben-Salem, Serge Harnois, F. Magalhães, G. Nicolescu\",\"doi\":\"10.1109/NEWCAS52662.2022.9842219\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In safety-critical multi-core architectures, isolation becomes more challenging as multiple components are shared between the cores, which generates delays in execution time called interferences. To reduce buses contention, it is important to limit the bandwidth allocated to each application. Current state-of-the-art solutions for bus budgeting allocation are not scalable and do not provide the correct level of flexibility to model complex systems. To cope with these challenges, we propose a novel heuristic to generate the schedule, mapping and bus budget allocation. We achieve scalable execution times up to 45 times faster compared to the state of the art. We further introduce real-life constraints such as application dependencies, forced mapping and release time. Compared to the state of the art, our approach is applicable in complex systems.\",\"PeriodicalId\":198335,\"journal\":{\"name\":\"2022 20th IEEE Interregional NEWCAS Conference (NEWCAS)\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-06-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 20th IEEE Interregional NEWCAS Conference (NEWCAS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NEWCAS52662.2022.9842219\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 20th IEEE Interregional NEWCAS Conference (NEWCAS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NEWCAS52662.2022.9842219","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Efficient Scheduling, Mapping and Memory Bandwidth Allocation for Safety-Critical Systems
In safety-critical multi-core architectures, isolation becomes more challenging as multiple components are shared between the cores, which generates delays in execution time called interferences. To reduce buses contention, it is important to limit the bandwidth allocated to each application. Current state-of-the-art solutions for bus budgeting allocation are not scalable and do not provide the correct level of flexibility to model complex systems. To cope with these challenges, we propose a novel heuristic to generate the schedule, mapping and bus budget allocation. We achieve scalable execution times up to 45 times faster compared to the state of the art. We further introduce real-life constraints such as application dependencies, forced mapping and release time. Compared to the state of the art, our approach is applicable in complex systems.