Mark–compact algorithm
In computer science, a mark–compact algorithm is a type of garbage collection algorithm used to reclaim unreachable memory. Mark–compact algorithms can be regarded as a combination of the mark–sweep algorithm and Cheney's copying algorithm. First, reachable objects are marked, then a compacting step relocates the reachable (marked) objects towards the beginning of the heap area. Compacting garbage collection is used by modern JVMs, Microsoft's Common Language Runtime and by the Glasgow Haskell Compiler.
- Comment
- enIn computer science, a mark–compact algorithm is a type of garbage collection algorithm used to reclaim unreachable memory. Mark–compact algorithms can be regarded as a combination of the mark–sweep algorithm and Cheney's copying algorithm. First, reachable objects are marked, then a compacting step relocates the reachable (marked) objects towards the beginning of the heap area. Compacting garbage collection is used by modern JVMs, Microsoft's Common Language Runtime and by the Glasgow Haskell Compiler.
- Depiction
- Has abstract
- enIn computer science, a mark–compact algorithm is a type of garbage collection algorithm used to reclaim unreachable memory. Mark–compact algorithms can be regarded as a combination of the mark–sweep algorithm and Cheney's copying algorithm. First, reachable objects are marked, then a compacting step relocates the reachable (marked) objects towards the beginning of the heap area. Compacting garbage collection is used by modern JVMs, Microsoft's Common Language Runtime and by the Glasgow Haskell Compiler.
- Is primary topic of
- Mark–compact algorithm
- Label
- enMark–compact algorithm
- Link from a Wikipage to another Wikipage
- Algorithm
- Big O notation
- Category:Automatic memory management
- Category:Memory management algorithms
- Cheney's algorithm
- Common Language Runtime
- Comparison sort
- Computer science
- Dead-code elimination
- File:Table-based heap compaction flattened.svg
- Fragmentation (computer)
- Garbage collection (computer science)
- Glasgow Haskell Compiler
- Java virtual machine
- LISP 2
- Mark–sweep algorithm
- Microsoft
- Unreachable memory
- SameAs
- 4nLRu
- Algorytm mark-compact
- Q603745
- Subject
- Category:Automatic memory management
- Category:Memory management algorithms
- Thumbnail
- WasDerivedFrom
- Mark–compact algorithm?oldid=1089827093&ns=0
- WikiPageLength
- 5244
- Wikipage page ID
- 9854002
- Wikipage revision ID
- 1089827093
- WikiPageUsesTemplate
- Template:Memory management navbox
- Template:Reflist
- Template:Use dmy dates
