首页> 外文OA文献 >Predictable Shared Memory Resources for Multi-Core Real-Time Systems
【2h】

Predictable Shared Memory Resources for Multi-Core Real-Time Systems

机译:多核实时系统的可预测共享内存资源

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

A major challenge in multi-core real-time systems is the interference problem on the shared hardware components amongst cores. Examples of these shared components include buses, on-chip caches, and off-chip dynamic random access memories (DRAMs). The problem arises because different cores in the system interfere with each other, while competing to access the shared hardware components. It is a challenging problem for real-time systems because operations of one core affect the temporal behaviour of other cores, which complicates the timing analysis of the system. We address this problem by making the following contributions. 1) For shared buses, we propose CArb, a predictable and criticality-aware arbiter, which provides guaranteed and differential service to tasks based on their requirements. In addition, we utilize CArb to mitigate overheads resulting from system switching among different modes. 2) For the cache hierarchy, we address the problem of maintaining cache coherence in multi-core real-time systems by modifying current coherence protocols such that data sharing is viable for real-time systems in a manner amenable for timing analysis. The proposed solution provides performance improvements, does not impose any scheduling restrictions, and does not require any source-code modifications. 3) At the shared DRAM level, we propose PMC, a programmable memory controller that provides latency guarantees for running tasks upon accessing the off-chip DRAM, while assigning differential memory services to tasks based on their bandwidth and latency requirements. In addition to PMC, we conduct a latency-based analysis on DRAM memory controllers (MCs). Our analysis provides both best-case and worst-case bounds on the latency that any request suffers upon accessing the DRAM. The analysis comprehensively covers all possible interactions of successive requests considering all possible DRAM states. Finally, we formally model request interrelations and DRAM command interactions. We use these models to develop an automatedvalidation framework along with benchmark suites to validate and evaluate PMC and any otherMC, which we release as an open-source tool.
机译:多核实时系统中的主要挑战是核之间共享硬件组件上的干扰问题。这些共享组件的示例包括总线,片上高速缓存和片外动态随机存取存储器(DRAM)。出现问题是因为系统中的不同核心相互竞争,同时竞争访问共享的硬件组件。对于一个实时系统而言,这是一个具有挑战性的问题,因为一个内核的操作会影响其他内核的时间行为,这会使系统的时序分析变得复杂。我们通过做出以下贡献来解决这个问题。 1)对于共享总线,我们建议使用CArb,这是一种可预测的,具有重要性感知的仲裁器,可根据任务的要求为任务提供有保证的差异服务。另外,我们利用CArb来减轻由于系统在不同模式之间切换而产生的开销。 2)对于高速缓存层次结构,我们通过修改当前的一致性协议来解决在多核实时系统中保持高速缓存一致性的问题,以便数据共享对于实时系统而言是可行的,并且可以进行时序分析。提出的解决方案提供了性能改进,没有施加任何调度限制,并且不需要任何源代码修改。 3)在共享DRAM级别上,我们提出了PMC,这是一种可编程存储器控制器,可在访问片外DRAM时为正在运行的任务提供等待时间保证,同时根据任务的带宽和等待时间要求为任务分配差分存储服务。除了PMC,我们还对DRAM存储器控制器(MC)进行基于延迟的分析。我们的分析提供了访问DRAM时任何请求遭受延迟的最佳情况和最坏情况的界限。该分析全面考虑了所有可能的DRAM状态,涵盖了连续请求的所有可能的交互。最后,我们正式对请求关联和DRAM命令交互进行建模。我们使用这些模型来开发自动验证框架以及基准套件,以验证和评估PMC和任何其他MC,并将其作为开源工具发布。

著录项

  • 作者

    Hassan Mohamed;

  • 作者单位
  • 年度 2017
  • 总页数
  • 原文格式 PDF
  • 正文语种 en
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号