Worst case delay analysis of shared resource access in partitioned multi-core systems

Donghyun Kang, Junchul Choi, S. Ha
{"title":"Worst case delay analysis of shared resource access in partitioned multi-core systems","authors":"Donghyun Kang, Junchul Choi, S. Ha","doi":"10.1145/3139315.3139322","DOIUrl":null,"url":null,"abstract":"In the worst case response time (WCRT) analysis of multi-core systems with shared resources, non-deterministic arbitration delay due to resource contention should be considered conservatively. In this paper, we propose a novel technique for modeling the shared resource contention to find a more accurate upper bound of arbitration delay than the state-of-the-art technique. After computing the worst-case resource demand from each processing element based on the event stream model, we consider the possible scheduling pattern of tasks to make a tighter estimation. The performance of proposed technique is verified by extensive experiments with MediaBench benchmark applications, synthetic task sets, and a real-life automotive example.","PeriodicalId":208026,"journal":{"name":"Proceedings of the 15th IEEE/ACM Symposium on Embedded Systems for Real-Time Multimedia","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 15th IEEE/ACM Symposium on Embedded Systems for Real-Time Multimedia","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3139315.3139322","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

In the worst case response time (WCRT) analysis of multi-core systems with shared resources, non-deterministic arbitration delay due to resource contention should be considered conservatively. In this paper, we propose a novel technique for modeling the shared resource contention to find a more accurate upper bound of arbitration delay than the state-of-the-art technique. After computing the worst-case resource demand from each processing element based on the event stream model, we consider the possible scheduling pattern of tasks to make a tighter estimation. The performance of proposed technique is verified by extensive experiments with MediaBench benchmark applications, synthetic task sets, and a real-life automotive example.
分区多核系统中共享资源访问的最坏情况延迟分析
在具有共享资源的多核系统的最坏情况响应时间(WCRT)分析中,由于资源争用而导致的不确定性仲裁延迟应予以保守考虑。在本文中,我们提出了一种新的共享资源争用建模技术,以找到比现有技术更准确的仲裁延迟上界。在基于事件流模型计算每个处理元素的最坏情况资源需求后,考虑任务可能的调度模式,进行更严格的估计。通过mediabbench基准测试应用程序、合成任务集和现实生活中的汽车示例进行了大量实验,验证了所提出技术的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信