The decision to free up a buffer pool slot is based on the least recently used (LRU) principle.
是否释放一个缓冲池槽，这是根据最近被使用(LRU)原则来决定的。
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)列表的形式管理缓冲区缓存。
For example, this kernel maintains separate Least Recently Used (LRU) lists, one for pages backed by files and another for pages backed by swap.
例如，这个内核维护分开的Least Recently Used (LRU)列表，一个用于文件支持的页，另一个用于交换支持的页。
How many items were evicted from the cache using the LRU (least recently used) algorithm?
使用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 memory region is a pure-memory cache region that uses a Least Recently Used (LRU) algorithm.
内存区域是一个使用最近最少算法（Least Recently Used，LRU）的纯内存缓存区域。
All buffers are organized into a long least-recently-used (LRU) buffer queues and are managed by least-recently-used (LRU) mechanism.
所有的缓冲区将被组织到一个较长的最近最少使用(least - recently - used,LRU)缓冲区队列中，并通过最近最少使用(LRU)机制进行管理。
All buffers are organized into a long least-recently-used (LRU) buffer queues and are managed by least-recently-used (LRU) mechanism.
所有的缓冲区将被组织到一个较长的最近最少使用(least - recently - used,LRU)缓冲区队列中，并通过最近最少使用(LRU)机制进行管理。
应用推荐