The old generation USES a mark-compact collector.
老的代使用标记-整理收集器。
There are several basic strategies for garbage collection: reference counting, mark-sweep, mark-compact, and copying.
有几种垃圾收集的基本策略：引用计数、标记-清除、标记-整理 (mark-compact)和复制。
The parallel copying collector and concurrent mark-sweep collector are basically concurrent versions of the default copying and mark-compact collectors.
并行复制收集器和并发标记-清除收集器基本上是默认的复制收集器和标记-整理收集器的并发版本。
In addition to the copying and mark-compact collectors used by default, the 1.4.1 JDK also contains four other garbage collection algorithms, each of which is suited to a different purpose.
除了默认情况下使用的复制收集器和标记-整理收集器，JD K1.4.1还包含其他四种垃圾收集算法，每一种适用于不同的目的。
GC occurs in three phases: mark, sweep, and optionally compact.
GC有三个阶段：标记、清除和可选地整理。
The generational collector employed by JDK 1.2 and later offers far better allocation and collection performance than the mark-sweep-compact collector used by earlier JDKs.
JD K 1.2及以后版本所使用的分代垃圾收集器提供了比早期JDK所使用的标记-清除-整理收集器好得多的分配和收集性能。
The same mark-sweep-compact collector is used, but much of the mark and sweep phases can be done as the application runs.
这种策略也使用 “标记-清扫-压缩 (mark-sweep-compact)” 收集器，但大部分标记和清扫工作可以在应用程序运行时执行。
The process has three major phases: mark, sweep, and compact.
这个过程有三个主要阶段：mark、sweep和compact。
The tenured collectors all use a mark-sweep-compact algorithm.
老年区收集器都使用了标记扫 描压缩（mark-sweep-compact）算法。
IBM implementation USES a garbage collection algorithm called mark-sweep-compact (MSC), which is named after three distinct phases.
IBM实现使用称为mark - sweep - compact (msc)的垃圾收集算法，它是根据三个不同的阶段命名的。
The parallel mark-sweep-compact collector: optthruput.
平行式“标记-清扫-压缩”收集器：optthruput。
The mark phase took 422 ms, the sweep phase took 37 ms, and the compact phase took 0 ms.
mark阶段422ms,sweep阶段37 ms,compact阶段0 ms。
Choose from a compact traffic light, a medium-sized traffic forecast, or a full-sized map where colored lines mark congestion on specific streets.
选择从紧凑型红绿灯，一个中等规模的业务量预测，或全尺寸的地图，彩色线条标出拥堵的街道具体。
The GC's Mark and Compact algorithm efficiently detects these relationships and removes unreachable webs of objects in their entirety.
GC的“标记和压缩”算法，在它们中检测关系、移除不可达页面对象上，是高效的。
The GC's Mark and Compact algorithm efficiently detects these relationships and removes unreachable webs of objects in their entirety.
GC的“标记和压缩”算法，在它们中检测关系、移除不可达页面对象上，是高效的。
应用推荐