安全关键系统的高效调度、映射和内存带宽分配

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}
引用次数: 1

摘要

在安全关键型多核体系结构中,隔离变得更具挑战性,因为多个组件在核心之间共享,这会产生称为干扰的执行时间延迟。为了减少总线争用,限制分配给每个应用程序的带宽非常重要。当前用于总线预算分配的最先进的解决方案是不可扩展的,并且不能为复杂系统建模提供适当的灵活性。为了应对这些挑战,我们提出了一种新的启发式方法来生成调度、映射和公交预算分配。我们实现的可扩展执行时间比现有技术快45倍。我们进一步引入现实生活中的约束,例如应用程序依赖、强制映射和发布时间。与目前的技术水平相比,我们的方法适用于复杂系统。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信