A novel dynamic cache partitioning strategy based on pseudo-LRU policies(PLRU-SCP)is proposed in this paper.The analysis circuit for the proposed strategy makes use of a new statistical method based on binary tree
and the partitioning circuit employs the non-exhaustive algorithm.Besides
we presents a novel shared cache structure.According to simulation results
the proposed shared cache with PLRU-SCP outperforms those without the partitioning strategy using LRU policy(LRU-NP)by 11.05% on average performance
and has a better performance than those with the utility-based partitioning strategy using LRU method(LRU-UCP)by 8.66%.