Mark-compact algorithm

From Wikipedia, the free encyclopedia

 This article is orphaned as few or no other articles link to it.
Please help introduce links in articles on related topics. (April 2008)


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.

Comp Sci logo This computer science-related article is a stub. You can help Wikipedia by expanding it.