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 article, 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.

中文翻译：

---

多核系统基于页面可重用性的缓存分区


大多数现代多核处理器都提供共享的末级缓存 (LLC)，其中放置来自所有内核的数据以提高性能。然而，由于缓存污染，这给缓存管理带来了新的挑战。由于缓存污染，当时间局部性较弱的数据映射到同一缓存集时，时间局部性较弱的数据可能会驱逐其他时间局部性较强的数据。在本文中，我们为多核系统提出了基于页面可重用性的缓存分区（PRCP），通过最小化缓存污染来最大化缓存利用率。为了实现这一点，PRCP 将页面分为两组：(1) 高度重用页面和 (2) 低度重用页面。每个页面的可重用性是通过定期页表扫描在线收集的。然后 PRCP 使用页面着色技术将共享缓存动态划分为两个相应的区域。我们在 Linux 内核中实现了 PRCP，并使用 SPEC CPU2006 基准测试对其进行了评估。结果表明，我们的方案可以实现与最佳离线 MRC 引导的基于进程的缓存分区方案相当的性能，而无需先验了解工作负载。