When the memory cache region becomes full, LRU removes the least recently used cached data first.
当内存缓存区域满时，lru会首先删除最近最少使用的缓存数据。
The buffer cache is managed as a set of least recently used (LRU) lists.
以最近使用(LRU)列表的形式管理缓冲区缓存。
It is not suited for high throughput caching and does not provide any LRU based cache invalidation or distributed locking semantics.
它不适合进行高吞吐量的缓存，也不支持基于LRU (Latest Recently Used)的缓存校验与分布式的锁语义。
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 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)算法删除条目。
However you can raise the sample size to 10 at the cost of some additional CPU usage in order to closely approximate true LRU, and check if this makes a difference in your cache misses rate.
你可以提升样品大小配置到10，它将接近真正的LRU算法，并且有不同错过率，但是要消耗更多的CPU。
The LRU-like algorithm is proposed for the block management of augmented cache scheme.
提出了一个用于扩充高缓块管理的近似LRU算法。
The LRU-like algorithm is proposed for the block management of augmented cache scheme.
提出了一个用于扩充高缓块管理的近似LRU算法。
应用推荐