Journal of Northeastern University ›› 2011, Vol. 32 ›› Issue (1): 44-47.DOI: -

• OriginalPaper • Previous Articles     Next Articles

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:
    -

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.

CLC Number: