Object pooling helps level out the number of allocations made on the heap, since the most common objects in an application can be pooled.
对象池机制有助于减小在堆上进行的分配的数量，因为可以汇聚应用程序中最常见的对象。
Resource statistics: Show execution group level resource statistics such as JVM heap and socket data.
资源统计：显示执行组级别的资源统计，比如jvm堆和套接字数据。
Terracotta USES a hub and spoke architecture where the central server to coordinates heap changes across JVMs, pushing field-level changes to each server on an as-needed basis.
Terracotta使用了星型(hubandspoke)架构，由中央服务器协调JV M间内存堆的改动，给每个需要的节点推送属性级的变动。
It does this by clustering at the heap-level underneath the application instead of clustering the application directly.
它通过在应用下面的堆级别进行集群而不是直接集群应用。
This is a good fit for large-scale server applications which often have large amounts of live heap data and considerable thread-level parallelism.
这对于经常产生大量存活堆数据和线程级别数据的大规模服务器端应用来说是非常棒的。
These sorts of applications are characterized by large amounts of live heap data and considerable thread-level parallelism, and are often run on high-end multi-core processors.
这类应用的特点是存在大量活跃堆数据和线程级别的并发，并且往往运行在高端多核处理器上。
It does not provide in-depth, low-level, expert functions to manually examine the entire object graph within the heap.
它并未提供深入、低级的专家功能，即手动检查堆内的整个对象图。
Monitoring the top-level components, such as the heap, servlet threads, and DB connection pool, provides an insight into what is happening when a request is being processed by the JVM.
监视诸如堆、Servlet线程和数据库连接池等顶级组件，可以了解JVM处理请求时所发生的情况。
In aspects of heap carrying to prepare to press construction, relevant technique norm provision can pass generally level moves with sink to decline to prognosticate control to add the velocity.
在堆载预压施工方面，有关技术规范规定一般可通过水平位移和沉降观测来控制加荷速率。
Top of the Scrap Heap-Reach a combined class level of 100 in Multiplayer.
在多人模式中，所有职业的等级总合达到100。
If this is the kind of heap you are referring to, the constraints tighten significantly, since you always fill the tree one level at a time from the left to the right.
如果这是堆的你是指，约束明显收紧，因为你总是填满树一层从左到右一次。
If this is the kind of heap you are referring to, the constraints tighten significantly, since you always fill the tree one level at a time from the left to the right.
如果这是堆的你是指，约束明显收紧，因为你总是填满树一层从左到右一次。
应用推荐