Although multi-core processors enhance the performance yet the challenge of estimating Worst-Case Execution Time (WCET) of a task remains in such systems due to interference in shared resources like Last Level Caches (LLC). Cache partitioning has been used to reduce the interference problem by isolating the shared cache among each thread to ease the WCET estimation. However, it prevents information shared among parallel threads running in different cores. In current work, we propose sharing and reuse aware partitioned cache (SRCP) framework such that replication of shared information, data, or instruction, in different partitions could be avoided in LLC. Further, enhancement in existing cache replacement policy is proposed, which avoids eviction of cache blocks shared among multiple cores accessing partitioned last level cache. Tighter WCET, as well as improved resource utilization, is thereby ensured with the proposed framework. Experimental results show that SRCP shows significant improvement in cache hit-rate for PARSEC and SPLASH2 benchmarks as compared to least recently used cache replacement policy and outperforms EHC and TA-DRRIP, which are state-of-the-art replacement policies.

尽管多核处理器提高了性能，但由于最后一级缓存 (LLC) 等共享资源的干扰，估计任务的最坏情况执行时间 (WCET) 的挑战仍然存在于此类系统中。缓存分区已被用于通过隔离每个线程之间的共享缓存来减少干扰问题，以简化 WCET 估计。但是，它会阻止在不同内核中运行的并行线程之间共享信息。在当前的工作中，我们建议共享和重用感知分区缓存 (SRCP) 框架，以便在 LLC 中可以避免在不同分区中复制共享信息、数据或指令。此外，提出了对现有缓存替换策略的改进，这避免了在访问分区的最后一级缓存的多个核之间共享的缓存块的逐出。更严格的WCET，以及改进的资源利用，从而通过提议的框架得到保证。实验结果表明，与最近最少使用的缓存替换策略相比，SRCP 在 PARSEC 和 SPLASH2 基准测试中的缓存命中率显着提高，并且优于 EHC 和 TA-DRRIP，它们是最先进的替换策略。