lru

lru怎么读

lru的意思释义

abbr.

line-replacement unit 线型更替单位；

lru用法及例句

例句参考

The LRU-K page replacement algorithm for database disk buffering

Modified LRU Policies for Improving Second-Level Cache Behavior

Outperforming LRU with an adaptive replacement cache algorithm

An optimality proof of the LRU-K page replacement algorithm

An optimality proof of the LRU- K page replacement algorithm

An Approximate Analysis of the LRU and FIFO Buffer Replacement Schemes.

A versatile and accurate approximation for LRU cache performance

Methods and apparatus for implementing a pseudo-LRU cache memory replacement scheme with a locking feature

On the existence of a spectrum of policies that subsumes the least recently used (LRU) and least frequently used (LFU) policies

lru相关例句

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

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

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

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

3. When this configuration parameter is enabled, the database server automatically adjusts the number of AIO virtual processors and cleaner threads, and automatically tunes LRU flushing.

当这个配置参数被启用时，数据库服务器自动调整AIO虚拟处理器和清理线程的数量，并自动调优LRU刷新。

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

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

5. A component or a Line Replaceable Unit (hereinafter the \"LRU\") is considered as obsolete when it is no longer possible to order identical or functionally equivalent and compatible spare parts.

当不再能定购相同或功能等效或可兼容的备件时，一个组件或一条线上的可更换单元（以下称“LRU”）就要被淘汰。

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

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

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

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

10. The host, lacking guest page access information, is unable to properly apply its LRU algorithms when selecting pages to swap.

由于主机缺乏客户页访问信息，从而不能在选择交换页面时合理地使用LRU算法。

11. The simulation results show that the hit-ratios promotion of CMQ algorithm can come up to 125%, compared with traditional algorithms such as LFU and LRU etc.

仿真结果表明，与LRU，LFU等传统置换算法相比，用于存储节点缓存的置换算法CMQ命中率提升可达125%以上。

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

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

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

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

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

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

18. The paper analyzes and compares LRU algorithm, and combined with practical application, presents the improvement.

本文分析、比较LRU算法，并就实际应用提出改进方案。

kns50.chkd.cnki.net

19. In this way, the pageout code does not need to iterate unevictable pages in the LRU list, leading to improved performance in systems with very large numbers of pages.

以这种方式，分页代码就无需迭代LRU 内不可收回的页，这使具有大量页的系统的性能得到提高。

20. Shipping and handling is suspect from the time an LRU is removed from its position in the airplane until it is reinstalled in another airplane.

LRU从飞机上拆下直到重新安装到飞机上的期间，运输和搬运是令人担忧的问题。

23. Less aggressive LRU flushing can improve transaction performance.

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

24. Aiming at accessing characteristics of CD jukebox, a cache structure based on type is represented, corresponding with a Type-Based LRU replacement algorithm.

分析了光盘库访问特性，设计并实现了一个基于文件类型的副本缓存结构以及相应的缓存替换算法。

25. Such evictions are typically determined by a \"time-to-live\" (TTL) or \"least-recently-used\" (LRU) algorithm.

这种排除操作通常由“生存时间”(TTL)或“较近较少使用”算法确定。

26. For example, this kernel maintains separate Least Recently Used (LRU) lists, one for pages backed by files and another for pages backed by swap.

例如，这个内核维护分开的LeastRecentlyUsed (LRU)列表，一个用于文件支持的页，另一个用于交换支持的页。

27. 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）算法删除条目。

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

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

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

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

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

31.LRU [Least Recently Used]

较近较少使用到的

32.LRU - Line Replaceable Unit

线性可替代单元

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

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

35.LRU least recently used

较少较近使用