这些指令通常覆盖默认缓存算法。
These directives typically override the default caching algorithms.
加速：理解不同的负载平衡算法选项和内容缓存。
Acceleration: Understand the different load balancing algorithm options and content caching.
驱动器上的缓存容量、所使用的硬盘算法、接口速度和磁录密度组合到一起，就构成了磁盘传输时间。
When combined, the cache capacity on the drive, the disk algorithms used, the interface speed, and the areal density, produce a disk transfer time.
驱动缓存容量和算法。
驱动器缓存和算法一起可以提高数据进出驱动器的速度，以及为RAID5实现进行奇偶检验。
Together, drive cache and algorithms work to improve the transfer of data in and out of the drive and to make parity calculations for RAID 5 implementations.
这对于 best-fit算法非常有用，可以用来查找最适合所需要的分配大小的缓存（遍历列表）。
This is useful for best-fit algorithms that look for a cache that most closely fits the size of the desired allocation (iterating the list).
为了模拟这一场景，我们研发了一个算法，每20分钟作废整个缓存的25%—类似于实时库存清单产生的效果。
To simulate this scenario, we developed an algorithm that invalidated 25% of the cache entries every twenty minutes - similar to the effect that is caused by a live inventory feed.
使用LRU(最近较少使用)算法从缓存中逐出的条目有多少。
How many items were evicted from the cache using the LRU (least recently used) algorithm?
内存区域是一个使用最近最少算法（Least RecentlyUsed，LRU）的纯内存缓存区域。
The memory region is a pure-memory cache region that uses a Least Recently Used (LRU) algorithm.
有一个算法可以用来调整容器的EJB缓存大小，它根据不同类型的bean来计算平均eJB缓存需求。
There's an algorithm you can use to tune the EJB cache size of the container that calculates the average EJB cache requirements based on the different kinds of beans.
注意，这个缓存对于您使用的特定遍历算法并不真正需要，我在这里使用它只是为了展示当您将来需要扩展这个工具时应该怎样做。
Note the caching is not really required for the particular traversal algorithm you are using, but I leave it in to show how to do this if it is needed as you expand this tool in the future.
这指的是驱动器上可用的缓存数，以及用于读写数据的算法集。
This is the amount of cache available on the drive, as well as the set of algorithms that are used to read and write data.
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.
另外一个办法是在多遍渲染中使用模板缓存的算法来控制场景中那些部分将被投影纹理更新。
Another way is to use the stencil buffer in a multipass algorithm to control what parts of the scene are updated by a projected texture.
接着TelluriumEngine使用Santa算法，定位整个UImodule，并将其存在缓存中。
The Tellurium Engine then USES the Santa algorithm to locate the whole UI module and put it into a cache.
首先，缓存会实现最近最少使用的算法，使得 ASP.NET能够在内存运行效率较低的情况下强制缓存清除——从缓存自动删除未使用过的项目。
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.
该文提出了一种基于客户端缓存容量的分区流切入算法。
This paper proposes a novel algorithm called Partition Stream Tapping Based on Client Buffer Size.
性能评估实验结果表明，上述算法的集成能有效地提高缓存命中率和延迟节省率。
Performance evaluation experiment results show the integration of the above algorithms can effectively enhance cache hit ratio and delay saving ratio.
基于时间的缓存攻击是指通过分析处理器中算法的不同执行时间来恢复密钥的攻击。
Time-based cache attacks analyzes the time difference in the execution of algorithm over a processor, and recovers the secret key.
为了提高视频服务器的资源利用率、提高客户端节目的播放质量和流畅性，我们提出一种动态的缓存管理算法。
In order to improve the efficiency of the resource utilization of the VOD server and for the high quality of playback in the clients, we propose a novel dynamic buffer management algorithm.
的GPU内存可以被认为是一个“缓存”，GPU目前经营上的数据，但许多GPU算法的设计有更多的数据比操作可以在“缓存”。
The GPU memory could be considered to be a "cache" of data that the GPU is currently operating on, but many GPU algorithms are designed to operate on more data than can fit in the "cache".
同时，在集群分发过程中应用该算法，可提高请求的调度效率和节点的缓存命中率。
Meanwhile, applying the algorithm to the process of dispatching can improve the scheduling efficiency of requests and cache hit ratio of nodes.
在硬件纹理加速体重建算法的基础上，提出了两种模拟三维数据切割的方法：利用深度缓存实现和利用离散距离场实现。
Based on hardware-accelerated texture-based volume rendering algorithm, this paper proposed two methods for volume cutting, which are based on either depth buffer or discrete distance field.
提出了适用于移动流媒体系统的，使所有流媒体节目的总的综合节省值最大的缓存分配算法。
A cache allocation algorithm that applies to the mobile streaming media system is put forward to make the total integrated saving of all the streaming media program maximal.
描述该框架的组成结构与工作原理，对缓存设计时需要解决的透明性、一致性、替换算法和预取策略等主要问题进行讨论并给出性能测试和分析。
It describes in structure and principle of ABWC and discusses transparency, consistency, replacement algorithm, prefetching policy and other main problems which need to be solved in cache designing.
然后根据实际应用需求，在GOT算法基础上实现了焦点维护和历史缓存清洗。
According to actual application demand, focus maintenance and history buffer cleaning based on GOT algorithm is realized.
轮询的开销很高，可能需要对其进行调整，在缓存清理算法的反应速度与轮询调用次数之间进行折中。
This polling is expensive and might need to be adjusted as a tradeoff between reaction speed of the cache-trimming algorithm and number of polling calls made.
分组调度方面：提出了一种新的多级缓存并行分组交换结构和一种分布式变长分组调度算法（DVLPS）。
On packet scheduling: A novel multi-stage buffering PPS and the Distributed Variable-Length Packet Scheduling (DVLPS) algorithm are present.
分组调度方面：提出了一种新的多级缓存并行分组交换结构和一种分布式变长分组调度算法（DVLPS）。
On packet scheduling: A novel multi-stage buffering PPS and the Distributed Variable-Length Packet Scheduling (DVLPS) algorithm are present.
应用推荐