Files
2nd/10_Wiki/Topics/Programming & Language/Mark-Sweep-Compact 알고리즘.md
T
2026-05-10 22:08:15 +09:00

35 lines
1.1 KiB
Markdown

---
id: wiki-2026-0508-mark-sweep-compact-알고리즘
title: Mark-Sweep-Compact 알고리즘
category: 10_Wiki/Topics
status: duplicate
canonical_id: garbage-collection
duplicate_of: "[[Garbage Collection]]"
aliases: []
source_trust_level: A
confidence_score: 0.9
verification_status: redirected
tags: [duplicate, gc, v8, memory]
last_reinforced: 2026-05-10
github_commit: pending
---
# Mark-Sweep-Compact 알고리즘
> **이 문서는 [[Garbage Collection]] 의 중복본입니다.** Canonical 문서로 redirect.
## 핵심 요약 (specialization aspects)
- 매 Mark-Sweep-Compact 는 V8 Old Space 의 major GC 알고리즘.
- 매 3-phase: Mark (live obj 표시) → Sweep (dead 제거) → Compact (fragmentation 해소).
- 매 stop-the-world 의 X — Orinoco 의 incremental + concurrent 의 mix.
## 🔗 Graph
- 부모: [[Garbage Collection]] (canonical)
- Adjacent: [[Orinoco 가비지 컬렉터]] · [[Old Space]] · [[Incremental Marking]] · [[Write Barrier]]
## 🕓 변경 이력
| 날짜 | 변경 |
|---|---|
| 2026-05-08 | Phase 1 |
| 2026-05-10 | 중복 처리 — canonical 문서로 redirect |