Value Evaluation Of Cache Replacement Strategy

Cpu capacity is small but reading fast,while the memory capacity is much bigger but reading slow.With the speed of the development of science and technology,Their speed difference of a few hundred times.And the Cpu access speed of the memory affect the computer speed,Cache as an intermediate storage point is used to solve this problem.When the hit rate of cache is high enough,it is equal to access the memory with the speed of cache,which greatly improves the performance of the computer.In order to improve the hit rate of cache,a lot of strategies for cache storage is produced and the research of cache strategies is quite important.But any kind of strategy has an advantage over other strategies in a certain environment.So how to measure to merits of these strategies?At the same time,how to find the most suitable cache strategy for a new data?At first the paper summarize the problem on cache.Then based on the concept of distance and the definition of hit function,using the methods of theoretical analysis and simulation of various replacement strategy is evaluated.We find a way to calculate the value of block size of cache.We give a new algorithm and estimate the advantage and the disadvantage of the algorithm.At last,we give the optical strategy under the certain data and the effect of cache size on the hit rate are given.