首页> 外文期刊>Computer architecture news >PIPP: Promotion/Insertion Pseudo-Partitioning of Multi-Core Shared Caches
【24h】

PIPP: Promotion/Insertion Pseudo-Partitioning of Multi-Core Shared Caches

机译:PIPP:多核共享缓存的升级/插入伪分区

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

摘要

Many multi-core processors employ a large last-level cache (LLC) shared among the multiple cores. Past research has demonstrated that sharing-oblivious cache management policies (e.g., LRU) can lead to poor performance and fairness when the multiple cores compete for the limited LLC capacity. Different memory access patterns can cause cache contention in different ways, and various techniques have been proposed to target some of these behaviors. In this work, we propose a new cache management approach that combines dynamic insertion and promotion policies to provide the benefits of cache partitioning, adaptive insertion, and capacity stealing all with a single mechanism. By handling multiple types of memory behaviors, our proposed technique outperforms techniques that target only either capacity partitioning or adaptive insertion.
机译:许多多核处理器采用了在多个核之间共享的大型最后一级缓存(LLC)。过去的研究表明,如果多个内核争夺有限的LLC容量,则会忽略共享而忽略高速缓存管理策略(例如LRU)会导致性能和公平性下降。不同的内存访问模式可能以不同的方式引起缓存争用,并且针对这些行为中的某些行为提出了各种技术。在这项工作中,我们提出了一种新的缓存管理方法,该方法结合了动态插入和升级策略,以通过单一机制提供缓存分区,自适应插入和容量窃取的好处。通过处理多种类型的内存行为,我们提出的技术优于仅针对容量分区或自适应插入的技术。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号