Page Reusability-based Cache Partitioning for Multi-core Systems

Citations

WEB OF SCIENCE

14
Citations

SCOPUS

14

초록

Most modern multi-core processors provide a shared last level cache (LLC) where data from all cores are placed to improve performance. However, this opens a new challenge for cache management, owing to cache pollution. With cache pollution, data with weak temporal locality can evict other data with strong temporal locality when both are mapped into the same cache set. In this paper, we propose page reusability-based cache partitioning (PRCP) for multi-core systems to maximize cache utilization by minimizing cache pollution. To achieve this, PRCP divides pages into two groups: (1) highly-reused pages and (2) lowly-reused pages. The reusability of each page is collected online via periodic page table scans. PRCP then dynamically partitions the shared cache into two corresponding areas using page coloring technique. We have implemented PRCP in Linux kernel and evaluated it using SPEC CPU2006 benchmarks. The results show that our scheme can achieve comparable performance to the optimal offline MRC-guided process-based cache partitioning scheme without a priori knowledge of workloads. IEEE

키워드

Cache Partitioning; Last-level cache; LRU replacement policy; Multi-cores; Page Coloring; Computer operating systems; Pollution; Cache partitioning; Last-level caches; Lru replacements; Multi core; Page colorings; Reusability
제목
Page Reusability-based Cache Partitioning for Multi-core Systems
저자
Park J.; Yeom H.Y.; Son Y.
DOI
10.1109/TC.2020.2968066
발행일
2020-06-01
유형
Article
저널명
IEEE Transactions on Computers
권
69
호
6
페이지
812 ~ 818