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）的缓存校验与分布式的锁语义。

In this paper, we propose a new approach using static resizing selective-ways and hierarchical LRU replacement algorithm for achieving high performance and low energy dissipation of set-associative data cache.

该方法通过静态调节组映射策略，根据应用程序的自身特点调节数据Cache的容量大小，并且选择合理的替换算法，在保证高性能的同时降低了能量损耗。

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

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

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

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

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

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

In addition, the paper analyzes the features of the current replacement algorithm, updates the lexicon using LRU algorithm, so as to enrich and develop vocabulary system ensures that the efficiency of the lexicon.

然后，分析当前替换算法的特点，采用LRU算法对词库进行更新，从而丰富和发展了词汇系统，也保证了词库的时效性。

In the system, improved gain-based replacement algorithm and LRU algorithm are used to manage caches.

在该原型系统中,分别采用改进的基于增益模型的缓存增益算法和传统LRU算法 管理缓存,验证了改进的基于增益模型的缓存增益算法比传统LRU算法 优越, 同等条件下,启动延迟法更低,字节命中率更高.

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

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

analysis of page reference sequence's effecting on lru page replacement

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

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

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

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

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

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

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

For applications that are sensitive to response times, the old method of using aggressive LRU flushing to reduce checkpoint quiescent times can be changed.

对于对响应时间敏感的应用程序，可以改变使用主动的LRU刷新减少检查点静默时间的旧方法。

AWL algorithm is also superior to other LRU improved algorithms.

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