Abstract:

Chip MultiProcessor(CMP) commonly employs last level cache with large capacity and high associativity, but the traditional cache replacement policy LRU gradually loses its performance due to the cache dead block problem caused by high cache associativity. As a result, dynamic insertion policy, which can effectively solve such problems of LRU, has received much more attention. However, current researches mainly focus on the replacement policy, while there are few studies on the quantitative analysis of the replacement policies. This paper presents an entire new analytical cache model for cache dynamic insertion replacement. The model, which inputs the application's reuse distance information and employs the recursive iterating probability method, is always able to give an accurate miss rate prediction for different insertion policies. The simulation results reveal that the average absolute error of the model is 3.1% and the max is 15.6%。

Key words: CMP cache;cache replacement policy;dynamic insertion policy;recursive probability model