Shared Cache Partition Based on Improved LRU Replacement Policy
Shujuan Huang · Microelectronics & Computer · 2012
There is some concern about how to partition the last shared cache to decrease the bad influence of resource competition and the rate of miss.This paper propose a method of partitioning the last shared cache using the modified LRU algorithm.It can eliminate the resource competition,decrease the memory latency,improve the replacement policy and improve system throughout.