SLRF: A high-efficiency Shared Less Reused Filter in Chip Multiprocessors
In general, the Less Recently Used (LRU) policy was commonly employed to manage shared L2 cache in Chip Multiprocessors. However, LRU policy remains some deficiencies based on previous studies. In particular, LRU may perform considerably bad when the workloads of application program are larger than L2 cache, because there are usually a great number of less reused lines that are never reused or reused for few times in L2 cache. The cache performance can be improved significantly if we keep non-less reused lines rather than less reused lines in cache for a time quantum. This paper proposes a new architecture called Shared Less Reused Filter (SLRF) that applying the less reused filter that can filter out the less reused lines rather than just never reused lines according to the context of Chip Multiprocessors. Our experiments on a large set of multithread benchmarks, for 11 splash-2 benchmarks, demonstrate that our technique shows that augmented in a 2M LRU-managed L2 cache with a SLRF which has 256 KB filter buffer improves IPC by 13.43％ compared with the context of the uniprocessor, and reduces the average MPKI by 18.20％.
Fitter buffer less reused Bite predictor shadow tag
Fuming Qiao Baozhong Yu Jianliang Ma Tianzhou Chen Tongsen Hu
College of Computer Science Zhejiang University of Technology, Hangzhou, China College of Computer Science Zhejiang University, Hangzhou, China
国际会议
深圳
英文
1191-1197
2011-03-28（万方平台首次上网日期，不代表论文的发表时间）