Page Reusability-based Cache Partitioning for Multi-core Systems
- Authors
- Park J.; Yeom H.Y.; Son Y.
- Issue Date
- 1-Jun-2020
- Publisher
- IEEE Computer Society
- Keywords
- Cache Partitioning; Last-level cache; LRU replacement policy; Multi-cores; Page Coloring
- Citation
- IEEE Transactions on Computers, v.69, no.6, pp 812 - 818
- Pages
- 7
- Journal Title
- IEEE Transactions on Computers
- Volume
- 69
- Number
- 6
- Start Page
- 812
- End Page
- 818
- URI
- https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/37925
- DOI
- 10.1109/TC.2020.2968066
- ISSN
- 0018-9340
1557-9956
- Abstract
- 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
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Software > School of Computer Science and Engineering > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/37925)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.