缓存是 英语是什么意思 - 英语翻译

• cache is
• caching is

在 中文 中使用 缓存是 的示例及其翻译为 英语

缓存是在计算环境中临时存储一些东西的地方。
Cache is an area for storing something provisionally in a computing setting.

缓存是在计算环境中临时存储一些东西的地方。
Cache is a place to store something temporarily in the computing environment.

缓存是由总部位于英国的网络安全公司Fidus发现的。
The cache was discovered by U.K.-based cybersecurity firm Fidus.

因为优化结果缓存是一种标准的XML文件，所以您可以利用外部应用程序（比如MSExcel）对其进行分析。
Since the optimization result cache is a standard XML file, you can analyze it in external applications(e.g. MS Excel).

缓存是个好东西，但是当空间局部性和时间局部性比较低的时候，它不仅没用，还会拖慢程序。
Caching is a good thing, but when space locality and time locality are low, it is not only useless, it also slows down the program.

缓存是小而快的内存，临时缓冲近期执行过的指令，因为这样的指令很可能很快就要重新使用。
(A cache is a small, fast memory that buffers recently executed instructions, as such instructions are likely to be reused soon.).

缓存是一种流行的解决方案来避免重复执行昂贵或频繁使用的代码片段。
Caching is a popular solution to avoid the repeated execution of expensive or frequently used code snippets.

缓存是一种数据结构，用于快速查找已经执行的操作的结果。
A cache is a data structure used for fast lookup of results for already-executed operations.

缓存是避免重复执行昂贵或常用代码片段的流行解决方案。
Caching is a popular solution to avoid the repeated execution of expensive or frequently used code snippets.

缓存是一个小而快速的内存，用于缓冲最近执行的指令，因为这类指令很快就会被再次调用。
(A cache is a small, fast memory that buffers recently executed instructions, as such instructions are likely to be reused soon.).

缓存是一种流行的解决方案来避免重复执行昂贵或频繁使用的代码片段。
Caching is a popular solution to avoid repeatedly executing expensive or commonly used code snippets.

与较慢的i5-10310Y相比，3级缓存是完整的8MB芯片。
Compared to the slower i5-10310Y, the level 3 cache is the full 8 MB of the chip.

如果您的应用程序的读取性能导致您遇到麻烦，那么缓存是一种可以帮助改进它的策略。
If your application's read performance is what's causing you trouble, caching is one strategy that can help to improve it.

为CMS平台部署缓存或备份系统--wp超级缓存是WordPress用户的最佳选择。
Deploy cache or backup systems for your CMS platform- WP Super Cache is an excellent choice for WordPress users.

由于大的不命中处罚，DRAM缓存是全相连的，也就是说，任何虚拟页都可以放置在任何的物理页中。
Due to the large miss penalty, DRAM caches are fully associative, that is, any virtual page can be placed in any physical page.

但有些缓存是为单一运行的环境而设计的，并且只能在单JVM实例中正常的运行。
But some caches are typically designed for a standalone environment, and can only work within one JVM instance.

由于回扫是一瞬间，超过三缓存是无意义的。
Pumping for more than three hours is pointless.

例如，对快速变化或很少访问的数据进行缓存是没有意义的。
For example, it doesn't make sense to cache data that is rapidly changing or is seldom accessed.

Nginx中的缓存是以文件系统上分层数据存储的形式实现的。
Caching in nginx is implemented in the form of hierarchical data storage on a filesystem.

Nginx中的缓存是以文件系统上的分层数据存储的形式实现的。
Caching in nginx is implemented in the form of hierarchical data storage on a filesystem.

前向缓存是Web服务器网络外部的缓存，例如在客户电脑、ISP或公司网络上。
A forward cache is a cache outside the web server's network, e.g. on the client computer, in an ISP or within a corporate network.

客户端上的缓存是为了防止在信息已知的情况下发出多次请求。
Caching on the client occurs to prevent making multiple requests when the information is already known.

但专家表示，对于一支约5000人的警察来说，这种武器的缓存是不必要的。
But experts said this cache of weapons is unnecessary for a police force of around 5,000 people that is meant to guarantee public safety only.

由于String对象的缓存是性能的重要保证，因此通过使String类不可变来避免这种风险。
Since caching of String objects was important from performance reason this risk was avoided by making String class Immutable.

或许我们这种风格最适用于通讯的场景，在这种情况下，试图进行缓存是没有意义的。
Perhaps our style is best for communication where attempts at caching are pointless.

在Solr中，缓存是全局的，这意味着，即使缓存中发生了最微小的变化，所有索引都需要刷新。
In Solr, the caches are global, which means that, when even the slightest change happens in the cache, all indexing demands a refresh.

如果客户端的缓存是空的，位置算法需要三个网络往返（roundtrip），其中包括一次Chubby读取。
If the client's cache is empty, the location algorithm requires three network round-trips, including one read from Chubby.

例如，对返回搜索结果的网页进行缓存是没有意义的，因为此类查询与结果几乎始终是唯一的。
For example, it doesn't make sense to cache webpages that return the results of a search because such queries and results are almost always unique.