The memory region is a pure-memory cache region that uses a Least Recently Used (LRU) algorithm.
内存区域是一个使用最近最少算法（Least RecentlyUsed，LRU）的纯内存缓存区域。
Entries for the dentry cache are allocated from the dentry_cache slab allocator and use a least-recently-used (LRU) algorithm to prune entries when memory pressure exists.
dentry缓存的条目从dentry_cacheslab分配器分配，并且在缓存存在压力时使用最近不使用(least - recently - used,LRU)算法删除条目。
The simulated test shows that this algorithm is superior to LRU algorithm.
模拟测试的结果表明：本算法比lru算法优越。
The paper analyzes and compares LRU algorithm, and combined with practical application, presents the improvement.
本文分析、比较LRU算法，并就实际应用提出改进方案。
But in some cases, LRU algorithm causes many page faults, so improving LRU page replacement algorithm can reduce page faults, and therefore improve the performance of the system.
但LRU算法在某些情况下会产生较多的缺页失败，改进LRU算法，降低缺页失败次数，可以有效地提高系统性能。
But in some cases, LRU algorithm causes many page faults, so improving LRU page replacement algorithm can reduce page faults, and therefore improve the performance of the system.
但LRU算法在某些情况下会产生较多的缺页失败，改进LRU算法，降低缺页失败次数，可以有效地提高系统性能。
应用推荐