slides - Computing Systems Laboratory

Dynamic Cache Partitioning• LRU's “stack property” [Mattson etal. 1970]“An access that hits in a N-wayassociative cache using the LRUreplacement policy is guaranteed to hitalso if the cache had more than N ways,provided that the number of sets remainsthe same.”