Cache替换算法LRU和2Q的深度分析

Depth Analysis of LRU and 2Q on Cache Replacement Algorithm

Cache替换算法是内存和CPU交互时速度保证的关键,传统的LRU算法在处理偶然性数据访问时造成缓存污染严重,但其实现简单,命中率和效率尚可,故成为现今大多情况下使用的算法;2Q算法通过设置两个队列,A1队列通过暂存数据减弱偶发性数据的影响,实现同样简单且有不错的性能。通过编制的词法分析器分析程序代码得来的数据进行算法性能的比较。

Caehe replacement algorithm is the key to ensure the speed of memory and CPU interaction, the traditional LRU algorithm in dealing with accidental data access caused by cache pollution, but its implementation is simple and the hit rate and efficiency can be used now, in most cases the algorithm, the 2Q algorithm by setting two queue, queue AI reduces the influence of sporadic data through the temporary storage of data, to achieve the same performance is simple and has good, through the use of lexical analyzer analysis program code to compare the performance of the data algorithm.