首页> 中文期刊> 《计算机工程》 >一种新型共享Cache动态划分机制

一种新型共享Cache动态划分机制

         

摘要

By full using advantages of Utility-based Cache Partition(UCP) and Least-recently Used(LRU) policy, a new dynamic shared cache partitioning mechanism is presented. The proposed mechanism is called Improved Utility-based And least-recently used Cache Partition(IUL-CP). It reduces the pollution of multi-threads in the shared cache and resolves the low performance when all cores running the shared cache way number sensitive workloads in multi-core systems with the UCP mechanism. The evaluation, by running SPEC CPU2000 benchmarks, shows that IUL-CP improves the performance by 20.28% over LRU and 14.37% over UCP on average.%综合效用最优划分共享Cache方法和传统LRU方法的优点,提出一种新的动态划分共享Cache方法.该方法可消除不同线程在共Cache中的相互影响,当多核并行执行的程序均对共享Cache中占有的路数敏感时,可解决采用效用最优划分方法时的性能下降问题.经SPEC CPU2000测试表明,该方法与传统LRU和效用最优划分方法相比,系统整体性能平均分别提高20.28%和14.37%.

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号