Mark Sweep的例句大全

Simple ( non-lazy) Mark Sweep GC executes mark and sweep atomically.

简单（非延迟）标记清理GC以原子方式执行标记和清理。

Mark and sweep: Each piece of data is marked with a tag.

标记并清理（Mark and sweep）：每一块数据都被加上一个标签。

This is a Deferred Reference Counting ( DRC) mechanism combined with an incremental, conservative mark/ sweep collector.

它采用了一种延迟引用计数（Deferred Reference Counting，DRC）机制，并结合一个增量的、保守的标记/清除收集器。

Early JDKs used a single-threaded mark-sweep or mark-sweep-compact collector.

早期的JDK使用了单线程的标记-清除或者标记-清除-整理收集器。

There are several basic strategies for garbage collection: reference counting, mark-sweep, mark-compact, and copying.

有几种垃圾收集的基本策略：引用计数、标记-清除、标记-整理（mark-compact）和复制。

The generational collector employed by JDK1.2 and later offers far better allocation and collection performance than the mark-sweep-compact collector used by earlier JDKs.

JDK1.2及以后版本所使用的分代垃圾收集器提供了比早期JDK所使用的标记-清除-整理收集器好得多的分配和收集性能。

The parallel copying collector and concurrent mark-sweep collector are basically concurrent versions of the default copying and mark-compact collectors.

并行复制收集器和并发标记-清除收集器基本上是默认的复制收集器和标记-整理收集器的并发版本。

Like mark-sweep, mark-compact is a two-phase process, where each live object is visited and marked in the marking phase.

与标记-清除类似，标记-整理是两阶段过程，在标记阶段访问并标记每个活跃对象。

Last month, we looked at the classic garbage collection techniques of reference counting, copying, mark-sweep, and mark-compact.

上个月，我们分析了引用计数、复制、标记-清除和标记-整理这些经典的垃圾收集技术。

Two of the new collectors are designed to reduce collection pause time& the parallel copying collector and the concurrent mark-sweep collector.

新收集器中的两个――并行复制收集器和并发标记-清除收集器――设计为减少收集暂停时间。

The copying algorithm has excellent performance characteristics, but it has the drawback of requiring twice as much memory as a mark-sweep collector.

复制算法的性能很优异，但是它有一个缺点是需要两倍于标记-清除收集器所需要的内存。

Mark-sweep is simple to implement, can reclaim cyclic structures easily, and doesn't place any burden on the compiler or mutator like reference counting does.

标记-清除实现起来很简单，可以容易地回收循环的结构，并且不像引用计数那样增加编译器或者赋值函数的负担。

The big problem with mark-sweep is that every active ( that is, allocated) object, whether reachable or not, is visited during the sweep phase.

标记-清除的最大问题是，每一个活跃的（即已分配的）对象，不管是不是可到达的，在清除阶段都是可以访问的。

Mark-sweep and mark-compact collectors, however, expend considerably more effort examining dead objects, because they must examine every object in the heap during the sweep phase.

不过，标记-清除和标记-理整收集器要做很多额外的分析死亡对象的工作，因为在清除阶段它们必须分析堆中的每一个对象。

Mark-sweep collectors also tend to leave the heap fragmented, which can cause locality issues and can also cause allocation failures even when sufficient free memory appears to be available.

标记-清除收集器还容易使堆产生碎片，这会产生区域性问题并可以造成分配失败，即使看来有足够的自由内存可用。

The mark-compact algorithm combines mark-sweep and copying in a way that avoids this problem, at the cost of some increased collection complexity.

标记-整理算法结合了标记-清除和复制，避免了这个问题，代价是增加了一些收集复杂性。

Since WinRT is built on top of COM you have the same problems with the dichotomy between reference counting and mark-and-sweep garbage collectors.

由于WinRT是基于COM构建的，所以你同样会有引用计数和mark-and-sweep垃圾回收器之间无法融合的问题。

The process has three major phases: mark, sweep, and compact

这个过程有三个主要阶段：mark、sweep和compact

A GC pause usually consists of two distinct phases: the mark and sweep phases.

GC暂停通常包括两个独立阶段：标记阶段和清理阶段。

In this type of GC, only the mark and sweep phases of GC are run.

在这类GC内，只运行GC的mark和sweep阶段。