New replacement algorithm (LRU versus FIFO)
新的替换算法（LRU 与FIFO）
The virtual memory pages whose page frames are to be reassigned are selected using the VMM's page replacement algorithm.
可以使用VMM的页面置换算法来选择要重新分配页帧的虚拟内存页面。
Because the page replacement algorithm is always looking for free frames while it is doing its scanning on systems with a lot of memory, the number of frames to scan can be significant.
在对有大量内存的系统进行扫描时，因为页面置换算法始终寻找空闲帧，所以需要扫描的页帧数量非常大。
The VMM has a page-replacement algorithm, which assigns the page frames and determines exactly which virtual-memory pages currently in RAM will have their page frames brought back to the free list.
VMM 提供了一种页面置换算法，该算法用于分配页帧，以及确定应该将当前RAM 中的哪些虚拟内存页面的页帧置换回空闲列表。
After analysing its mechanism, it gives the replacement algorithm in detail.
在分析本策略的替换机制后，给出了具体的替换算法。
Furthermore, a replacement algorithm of current index nodes and backup strategy were proposed to improve the query performance and stability of the overall network.
同时，通过当前索引节点的替换算法和备份策略进一步提高整个网络的查询性能和稳定性。
A reasoning-oriented context replacement algorithm (CORA) is presented, which aims at promoting the hit rate of context cache and reducing the overhead of context transmission.
面向推理的上下文缓存置换算法CORA的目标是使上下文缓存达到较高命中率，有效节省普适计算中传输上下文的开销。
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算法，降低缺页失败次数，可以有效地提高系统性能。
Adapting to the high variation environment in data grid, a data replica replacement algorithm based on value model is proposed and the arithmetic to calculate replica value is introduced.
针对网格环境下数据高度动态性的特点，提出了一种基于价值模型的数据副本替换算法，给出了副本价值计算方法，并把它应用到数据副本替换中。
Adapting to the high variation environment in data grid, a data replica replacement algorithm based on value model is proposed and the arithmetic to calculate replica value is introduced.
针对网格环境下数据高度动态性的特点，提出了一种基于价值模型的数据副本替换算法，给出了副本价值计算方法，并把它应用到数据副本替换中。
应用推荐