The buffer cache is managed as a set of least recently used (LRU) lists.
以最近使用(LRU)列表的形式管理缓冲区缓存。
This affects how the least recently used daemon (LRUDs) scan for pages to free.
这影响最近最少使用守护进程(least recently used daemon LRUD)扫描可释放页面的方式。
How many items were evicted from the cache using the LRU (least recently used) algorithm?
使用LRU(最近较少使用)算法从缓存中逐出的条目有多少。
In this case, AIX scans both classes of pages and evicts the least recently used pages.
在这种情况下，AIX将扫描两类分页，并且回收近来较少使用的分页。
When the memory cache region becomes full, LRU removes the least recently used cached data first.
当内存缓存区域满时，lru会首先删除最近最少使用的缓存数据。
The decision to free up a buffer pool slot is based on the least recently used (LRU) principle.
是否释放一个缓冲池槽，这是根据最近被使用(LRU)原则来决定的。
The memory region is a pure-memory cache region that uses a Least Recently Used (LRU) algorithm.
内存区域是一个使用最近最少算法（Least Recently Used，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)列表，一个用于文件支持的页，另一个用于交换支持的页。
The process by which a page is selected to swap to storage is called a page-replacement algorithm and can be implemented using a number of algorithms (such as least recently used).
选择一个页面来交换存储的过程被称为一个页面置换算法，可以通过使用许多算法(至少是最近使用的)来实现。
Think of a false access order as the default, where you must pass in a true to have the list in access order; that is, the head of the map is the least recently used map entry.
把false存取顺序作为缺省值，要获得一个存取顺序的列表，您必须传入一个true；也即映射表的头部是使用时间距今最远的映射表条目。
Many servlet containers place a limit on the amount of memory that can be used across all sessions, and when that limit is reached, will serialize the least recently used session and write it to disk.
许多servlet容器对可以跨所有会话使用的内存的数量有一个限制，达到这个限制时，会序列化最先使用的会话并将它写到磁盘上。
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)机制进行管理。
The first is that the Cache implements a least-recently-used algorithm, allowing ASP.NET to force a Cache purge—automatically removing unused items from the Cache—if memory is running low.
首先，缓存会实现最近最少使用的算法，使得 ASP.NET能够在内存运行效率较低的情况下强制缓存清除——从缓存自动删除未使用过的项目。
The precise algorithm used to decide which page should be swapped out depends on the version of Windows you are using; it's probably a variation of the least-recently-accessed method.
决定将哪些页交换出去的具体算法取决于所用的Windows版本，可能是最近最少访问算法的一种变体。
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)算法删除条目。
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)算法删除条目。
应用推荐