无争用多核实时存储系统的数据总线切片

J. Jalle, E. Quiñones, J. Abella, L. Fossati, Marco Zulianello, F. Cazorla
{"title":"无争用多核实时存储系统的数据总线切片","authors":"J. Jalle, E. Quiñones, J. Abella, L. Fossati, Marco Zulianello, F. Cazorla","doi":"10.1109/SIES.2016.7509441","DOIUrl":null,"url":null,"abstract":"Memory access contention is one of the main contributors to tasks' execution time variability in real-time multicores. Existing techniques to control memory contention based on time-sharing memory access do not scale well with increasing complexity of multicores, leading to a rapid increase of WCET estimates. This is due to fact that requests from different tasks interleave in the access to memory, and for each of its requests a task has to make worst-case time allowances to account for the memory state left by the previous request, that may belong to a different task. In this paper, we propose a memory organization that controls contention by dividing the data bus into narrower independent data buses, thus removing conflicts among different tasks accessing memory. While narrower data buses require extra transfers, they allow exploiting memory locality, hence only slightly affecting average performance. Our evaluation on a solid space case-study shows that the proposed memory organization provides contention-free memory access facilitating timing analysis and tightening WCET estimates.","PeriodicalId":185636,"journal":{"name":"2016 11th IEEE Symposium on Industrial Embedded Systems (SIES)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Data Bus Slicing for Contention-Free Multicore Real-Time Memory Systems\",\"authors\":\"J. Jalle, E. Quiñones, J. Abella, L. Fossati, Marco Zulianello, F. Cazorla\",\"doi\":\"10.1109/SIES.2016.7509441\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Memory access contention is one of the main contributors to tasks' execution time variability in real-time multicores. Existing techniques to control memory contention based on time-sharing memory access do not scale well with increasing complexity of multicores, leading to a rapid increase of WCET estimates. This is due to fact that requests from different tasks interleave in the access to memory, and for each of its requests a task has to make worst-case time allowances to account for the memory state left by the previous request, that may belong to a different task. In this paper, we propose a memory organization that controls contention by dividing the data bus into narrower independent data buses, thus removing conflicts among different tasks accessing memory. While narrower data buses require extra transfers, they allow exploiting memory locality, hence only slightly affecting average performance. Our evaluation on a solid space case-study shows that the proposed memory organization provides contention-free memory access facilitating timing analysis and tightening WCET estimates.\",\"PeriodicalId\":185636,\"journal\":{\"name\":\"2016 11th IEEE Symposium on Industrial Embedded Systems (SIES)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-05-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 11th IEEE Symposium on Industrial Embedded Systems (SIES)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIES.2016.7509441\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 11th IEEE Symposium on Industrial Embedded Systems (SIES)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIES.2016.7509441","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

内存访问争用是实时多核环境下任务执行时间变化的主要原因之一。现有的基于分时内存访问控制内存争用的技术不能很好地随多核复杂性的增加而扩展,从而导致WCET估计值的快速增加。这是因为来自不同任务的请求在对内存的访问中是交错的,并且对于它的每个请求,任务必须做出最坏情况时间的允许,以考虑可能属于不同任务的前一个请求留下的内存状态。在本文中,我们提出了一种内存组织,通过将数据总线划分为更窄的独立数据总线来控制争用,从而消除访问内存的不同任务之间的冲突。虽然较窄的数据总线需要额外的传输,但它们允许利用内存局部性,因此对平均性能的影响很小。我们对一个实体空间案例研究的评估表明,所提出的内存组织提供了无争用的内存访问,便于时间分析和收紧WCET估计。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Data Bus Slicing for Contention-Free Multicore Real-Time Memory Systems
Memory access contention is one of the main contributors to tasks' execution time variability in real-time multicores. Existing techniques to control memory contention based on time-sharing memory access do not scale well with increasing complexity of multicores, leading to a rapid increase of WCET estimates. This is due to fact that requests from different tasks interleave in the access to memory, and for each of its requests a task has to make worst-case time allowances to account for the memory state left by the previous request, that may belong to a different task. In this paper, we propose a memory organization that controls contention by dividing the data bus into narrower independent data buses, thus removing conflicts among different tasks accessing memory. While narrower data buses require extra transfers, they allow exploiting memory locality, hence only slightly affecting average performance. Our evaluation on a solid space case-study shows that the proposed memory organization provides contention-free memory access facilitating timing analysis and tightening WCET estimates.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Communication aware multiprocessor binding for shared memory systems Efficient algorithms for memory management in embedded vision systems Static probabilistic timing analysis in presence of faults Conformance checking for programmable logic controller programs and specifications Minimizing stack usage for AUTOSAR/OSEK's restricted fixed-priority preemption threshold support
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1