摘要:运行时动态WCET估计

Lia Cagnizi, F. Reghenzani, W. Fornaciari
{"title":"摘要:运行时动态WCET估计","authors":"Lia Cagnizi, F. Reghenzani, W. Fornaciari","doi":"10.1145/3576842.3589168","DOIUrl":null,"url":null,"abstract":"To guarantee the timing constraints of real-time IoT devices, engineers need to estimate the Worst-Case Execution Time. Such estimation is always very pessimistic and represents a condition that almost never occurs in practice. In this poster, we present a novel compiler-based approach that instruments the tasks to inform, at run-time, the operating system when non-worst-case branches are taken. The generated slack is then used to take better scheduling decisions.","PeriodicalId":266438,"journal":{"name":"Proceedings of the 8th ACM/IEEE Conference on Internet of Things Design and Implementation","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Poster Abstract: Run-time Dynamic WCET Estimation\",\"authors\":\"Lia Cagnizi, F. Reghenzani, W. Fornaciari\",\"doi\":\"10.1145/3576842.3589168\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To guarantee the timing constraints of real-time IoT devices, engineers need to estimate the Worst-Case Execution Time. Such estimation is always very pessimistic and represents a condition that almost never occurs in practice. In this poster, we present a novel compiler-based approach that instruments the tasks to inform, at run-time, the operating system when non-worst-case branches are taken. The generated slack is then used to take better scheduling decisions.\",\"PeriodicalId\":266438,\"journal\":{\"name\":\"Proceedings of the 8th ACM/IEEE Conference on Internet of Things Design and Implementation\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-05-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 8th ACM/IEEE Conference on Internet of Things Design and Implementation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3576842.3589168\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 8th ACM/IEEE Conference on Internet of Things Design and Implementation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3576842.3589168","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

为了保证实时物联网设备的时间约束,工程师需要估计最坏情况下的执行时间。这样的估计总是非常悲观,并且代表了一种在实践中几乎从未发生过的情况。在这张海报中,我们提出了一种新颖的基于编译器的方法,该方法使任务在运行时通知操作系统,当采取非最坏情况的分支时。然后利用产生的空闲来做出更好的调度决策。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Poster Abstract: Run-time Dynamic WCET Estimation
To guarantee the timing constraints of real-time IoT devices, engineers need to estimate the Worst-Case Execution Time. Such estimation is always very pessimistic and represents a condition that almost never occurs in practice. In this poster, we present a novel compiler-based approach that instruments the tasks to inform, at run-time, the operating system when non-worst-case branches are taken. The generated slack is then used to take better scheduling decisions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信