LRU

Study of persistent CORBA object management policy based on priorities and LRU algorithm

基于优先级和LRU算法的持续CORBA对象管理策略研究

The simulated test shows that this algorithm is superior to LRU algorithm .

模拟测试的结果表明：本算法比LRU算法优越。

Analysis of Page Reference Sequence 's Effecting on LRU Page Replacement

对页面访问序列影响LRU页面置换算法的研究

AWL algorithm is also superior to other LRU improved algorithms .

AWL算法与其它LRU改进算法相比也具有很大的优势。

Web Cache Mechanism Based on LRU Algorithm

基于LRU算法的Web系统缓存机制

Compared with traditional LRU algorithms , the two algorithms improve hit ratio and response delay time .

同传统的LRU算法相比较，它们复杂度低在命中率和响应延时这两项性能指标上都有一定程度的提高，有效改善了系统的高性能和低功耗。

On LRU Algorithm of Page - replacement Algorithm s

浅谈页面置换算法之LRU算法

Least Reference Used ( LRU ) page replacement is the current common used page replacement .

现有的应用于虚拟存储管理的页面置换算法主要是LeastReferenceUsed（LRU）页面置换算法。

Improvement thought of the LRU Page - Replacement Algorithms

对LRU页面置换算法的理论改进

Less aggressive LRU flushing can improve transaction performance .

更缓慢的LRU刷新可以提高事务性能。

Java Object Pooling Based on LRU Algorithm

基于LRU算法的Java对象池设计

A method of realizing the LRU substitution algorithm of Cache through experimentation is given .

给出了用实验的方式来仿真实现Cache的LRU算法的过程。

How many items were evicted from the cache using the LRU ( least recently used ) algorithm

使用LRU（最近较少使用）算法从缓存中逐出的条目有多少

Choosing the reasonable design method can realize the domestic substitutes of two modules mounted inside the LRU .

选择合理的设计方法来实现在LRU内部两种产品模块的原位替代。

A new file cache management based on Least Recently Used ( LRU ) was bring forward and realized in this paper .

本文针对嵌入式文件系统提出了一套基于最久未使用页面替换算法的高速缓存管理方案。

New replacement algorithm ( LRU versus FIFO )

新的替换算法（LRU与FIFO）

When the memory cache region becomes full , LRU removes the least recently used cached data first .

当内存缓存区域满时，LRU会首先删除最近最少使用的缓存数据。

Besides , the terrain component render algorithm is the important basis of multi-layer terrain and LRU algorithm .

此外，组件式地形也是本文提出的多层地形渲染算法和LRU数据加载算法很重要的基础。

We present a page replacement algorithm adapting between adaptive WFL and LRU algorithms .

在把页面访问序列划分为三类的基础上，本文提出了一种结合动态WFL算法和LRU算法的自适应页面置换算法AWL。

The buffer cache is managed as a set of least recently used ( LRU ) lists .

以最近使用（LRU）列表的形式管理缓冲区缓存。

Virtual file manager uses LRU algorithm to evict file handles and hash algorithm to find files .

虚拟文件管理采用LRU算法淘汰文件句柄、哈希算法查找文件。

LRU flushing can be less aggressive since transaction processing is not blocked during checkpoint processing .

LRU刷新可以放缓，因为在检查点处理期间事务不会被阻塞。

The decision to free up a buffer pool slot is based on the least recently used ( LRU ) principle .

是否释放一个缓冲池槽，这是根据最近被使用（LRU）原则来决定的。

By analyzing the design and implementation principle of cache , the cache framework based on J2EE with LRU algorithm is implemented .

该文分析了Cache技术的设计原理和实现策略、LRU算法的设计模式，构造了缓存机制的基本框架。

The LRU Substitution Algorithm Emulation Experimentation of Cache

Cache的LRU算法的仿真实验

The memory region is a pure-memory cache region that uses a Least Recently Used ( LRU ) algorithm .

内存区域是一个使用最近最少算法（LeastRecentlyUsed，LRU）的纯内存缓存区域。

The metadata caching uses a modified broadcasting caching coherence protocol and LRU caching block replacing algorithm .

元数据缓存使用改进的广播一致性协议和LRU替换算法。

This paper mainly discusses a assumption of account page faults , which transformation from LRU and LFU elimination algorithm .

本文主要讨论一种从LRU与LFU淘汰算法中变形得到的一种求缺页中断的设想。

Investigation of multiple failures of one part number LRU revealed that a free life-improvement modification had not been performed .

通过调查某个件号的LRU的失效情况发现，它没有执行过寿命改进工作。

After the modification was implemented , the LRU no longer showed up on the short-life unit list .

实施了寿命改进后，清单上再也没有出现该LRU寿命短的问题。