Abstract:

This paper proposes a shared Cache partitioning algorithm, based on throughput (IPC) and fairness, which in order to find a balance between fairness and throughput. We used the Cache access monitor to collect the missing rate information, and then decide the amount of Cache resources allocated to each application by the dynamic partitioning algorithm to resolve the problem of Cache pollution. Experiments show that shared Cache partitioning  based on IPC and fairness improves throughput by 15.71% on average （up to 37.90%）  over least recently used and by 14.11% on average （up to 47.37%） over fairness based Cache partitioning, and improves fairness by 77% on average （up to 4 times） over least recently used and by a factor of 2.29 on average （up to 9 times） over utility based Cache partitioning.

Key words: Cache partitioning, fairness, Cache access monitor