标记并压缩算法(Mark and Compact) GC使用"标记并压缩"(Mark and Compact)算法分析程序运行对象的关系，将不可达部分对象从内存中清理掉。
基于8个网页-相关网页
mark-and-compact 标记和压缩
The GC's Mark and Compact algorithm efficiently detects these relationships and removes unreachable webs of objects in their entirety.
GC的“标记和压缩”算法，在它们中检测关系、移除不可达页面对象上，是高效的。
GC occurs in three phases: mark, sweep, and optionally compact.
GC有三个阶段：标记、清除和可选地整理。
The parallel copying collector and concurrent mark-sweep collector are basically concurrent versions of the default copying and mark-compact collectors.
并行复制收集器和并发标记-清除收集器基本上是默认的复制收集器和标记-整理收集器的并发版本。
应用推荐