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.
Link from a Wikipage to another Wikipage
primaryTopic
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.
has abstract
Algorytm mark-compact – rodzaj ...... ft i Glasgow Haskell Compiler.
@pl
In computer science, a mark-co ...... the Glasgow Haskell Compiler.
@en
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,021,973,686
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
type
comment
Algorytm mark-compact – rodzaj ...... ft i Glasgow Haskell Compiler.
@pl
In computer science, a mark-co ...... the Glasgow Haskell Compiler.
@en
label
Algorytm mark-compact
@pl
Mark-compact algorithm
@en