中文摘要：

Pseudc-LRU替换算法可以避免复杂的硬件设计，所以在很多流行的Cache内存系统被使用．但是该算法的主要缺点是二叉树结构的顶层节点不能包含所有底部叶子节点的信息，在某些情况下会做出错误的替换决策．针对PLRU算法存在的问题，在分析PLRU算法的原理的基础上，通过增加处理二叉树顶层节点信息的逻辑，得到一种新的替换算法．测试结果表明，这种新的替换算法使Cache命中率提高到98．73％．

英文摘要：

Pseudo-LRU algorithm is used extensively in many Cache memory systems, because it can avoid the disadvantages of a complex hardware design. But the key disadvantage of this algorithm is that nodes at the top of the binary tree don＇t contain sufficient information about nodes at the bottom of the binary tree, and can make incorrect replacement decisions in some cases. Based on Pseudo-LRU, this paper proposes a new algorithm by adding logic of processing the information of nodes at the top of the binary tree. Experiment results reveal that PLRU-0 significantly increases hit rate to 98.73 %.