首页> 外文期刊>IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems >Predictability and Performance Aware Replacement Policy PVISAM for Unified Shared Caches in Real-time Multicores
【24h】

Predictability and Performance Aware Replacement Policy PVISAM for Unified Shared Caches in Real-time Multicores

机译:实时多核中统一共享缓存的可预测性和性能感知替换策略PVISAM

获取原文
获取原文并翻译 | 示例
           

摘要

Missing the deadline of an application task can be catastrophic in real-time systems. Therefore, to ensure timely completion of tasks, offline worst-case execution time and schedulability analysis is often performed for such real-time systems. One of the important inputs to this analysis is a safe upper bound of misses in each processor cache memory used by the system. Cache miss prediction techniques have matured significantly for private caches in single-core processors; however, remained as a challenge for unified, shared caches in multicore processors. According to prior studies, a task's miss upper bound on a shared cache can be predicted using available private cache prediction techniques only if the shared cache maintains core-based independent static partitions. The problem is, such partitions require the use of infeasible “write-update consistency protocol” and wastes valuable cache space by duplicate caching. In this regard, this paper presents a novel cache replacement policy called “predictable variable isolation in shared antipodal memory (PVISAM).” Its replacement decisions generate virtual core-based partitions that support demand-based runtime size adjustment and line sharing to better utilize space. Moreover, these partitions require no consistency protocol. Tracedriven experimental results for Parsec benchmark applications reveal that performance of a unified shared cache memory improves by 101.68x on average (minimum 1.09x and maximum 1138.50x) when PVISAM is used instead of either the aforementioned write-update protocol-based predictable partitioning or the widely used write-invalidate consistency protocol-based partitioning. PVISAM can improve cache performance by 0.74x on average (minimum 0.02x and maximum 1.12x) compared to having no partitions at all. Both predictable partitioning and PVISAM improve unified, shared cache predictability by 63.44% (minimum 26.89% and maximum 99.99%) and 19.36% (minimum 1.58% and maximum 72.51%) on average compared to no partitions and write-invalidate protocol-based partitioning, respectively. Experimental results for synthetic traces show that PVISAM remarkably improves cache performance and predictability when compared to its three competitors even in scenarios that stress the cache.
机译:错过应用程序任务的最后期限在实时系统中可能是灾难性的。因此,为了确保及时完成任务,通常会针对此类实时系统执行脱机最坏情况下的执行时间和可调度性分析。该分析的重要输入之一是系统使用的每个处理器高速缓存中未命中的安全上限。对于单核处理器中的专用缓存,缓存未命中预测技术已显着成熟。但是,这仍然是多核处理器中统一共享缓存的挑战。根据先前的研究,仅当共享缓存维护基于核心的独立静态分区时,才可以使用可用的专用缓存预测技术来预测任务在共享缓存上的未命中上限。问题是,这样的分区需要使用不可行的“写更新一致性协议”,并且通过重复缓存浪费了宝贵的缓存空间。在这方面,本文提出了一种新颖的缓存替换策略,称为“共享对映内存中的可预测变量隔离(PVISAM)”。它的替换决定生成基于虚拟核心的分区,这些分区支持基于需求的运行时大小调整和行共享,以更好地利用空间。而且,这些分区不需要一致性协议。 Tracesec针对Parsec基准测试应用程序的实验结果表明,使用PVISAM代替上述基于写更新协议的可预测分区或PVISAM时,统一共享缓存的性能平均提高101.68倍(最小1.09倍和最大1138.50倍)。广泛使用的基于写入无效一致性协议的分区。与根本没有分区相比,PVISAM可以将缓存性能平均提高0.74倍(最小0.02倍,最大1.12倍)。可预测的分区和PVISAM均使共享缓存的统一共享可预测性平均提高了63.44%(最小26.89%,最大99.99%)和19.36%(最小1.58%,最大72.51%)。分别设置为无分区和基于协议的写入无效分区。合成迹线的实验结果表明,即使在压力严重的情况下,与三个竞争对手相比,PVISAM也显着提高了缓存性能和可预测性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号