Jump to content

Mark–compact algorithm

Edit links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Rich Farmbrough (talk | contribs) at 22:10, 9 October 2009 (Replace Erik9bot cat with dated clean-up template, removed orphan tag using AWB). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The mark-compact algorithm is a garbage collection algorithm used to reclaim unreachable memory. It 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 Microsoft's Common Language Runtime.


Stub icon

This computer science article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Mark–compact_algorithm&oldid=318952663"