(4) 最久没有使用算法（LRU Least Recently Used algorithm）：它把LRU算法中的“多”与“少”简化成“有”与“无”，实现起来比较容易。
基于4个网页-相关网页
How many items were evicted from the cache using the LRU (least recently used) algorithm?
使用LRU(最近较少使用)算法从缓存中逐出的条目有多少。
The memory region is a pure-memory cache region that uses a Least Recently Used (LRU) algorithm.
内存区域是一个使用最近最少算法（Least Recently Used，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_cache slab分配器分配，并且在缓存存在压力时使用最近不使用(least - recently - used, LRU)算法删除条目。
应用推荐