东北大学学报（自然科学版）

东北大学学报(自然科学版) ›› 2011, Vol. 32 ›› Issue (1): 44-47.DOI: -

• 论著 • 上一篇    下一篇

基于多核处理器的动态共享缓存分配算法

周本海;乔建忠;林树宽;   

  1. 东北大学信息科学与工程学院;辽宁省软件开发与应用重点实验室;
  • 收稿日期:2013-06-19 修回日期:2013-06-19 发布日期:2013-04-04
  • 通讯作者: -
  • 作者简介:-
  • 基金资助:
    国家自然科学基金资助项目(60873009)

Research on the dynamic allocation algorithm of shared cache for multi-core processor

Zhou, Ben-Hai (1); Qiao, Jian-Zhong (1); Lin, Shu-Kuan (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110819, China; (2) Key Laboratory of Software System and Development Generic Technology, Shenyang 110819, China
  • Received:2013-06-19 Revised:2013-06-19 Published:2013-04-04
  • Contact: Zhou, B.-H.
  • About author:-
  • Supported by:
    -

RichHTML

0

PDF (PC)

740

摘要： 对于具有共享缓存结构的多核处理器,存在并行应用对共享缓存冲突访问导致性能下降的现象.为合理地分配共享缓存以有效地解决这类问题,提出了一种共享缓存分配方法,通过将并行应用对共享缓存访问未命中的情况进行分类与追踪,并根据建立的性能增益模型在行的粒度上进行动态地分配共享缓存,使系统的整体性能得到改善.实验结果表明,新算法能合理地为并行运行在多核处理器上的应用分配共享缓存,减少冲突访问,使系统达到更优的性能及更高的处理效率.

关键词: 多核, 并行, 共享缓存, 冲突访问

Abstract: It was found that on access which causes the conflict between parallel applications and shared cache will lead the system performance to degrade for the multi-core processor involving a shared cache. To solve the problem efficiently and reasonably, allocation algorithm is proposed for the shared cache, i.e., sorting and tracking the cases the parallel applications are missing the access as a target to shared cache, then the shared cache is allocated dynamically for cache's line granularity according to the performance gain model developed to improve the system performance. Testing results showed that the new algorithm is able to reduce the conflicting accesses and enable the system to achieve better performance and higher processing efficiency by allocating the shared cache to the parallel operations on multi-core processor reasonably.

中图分类号: