Jump to content

Mark–compact algorithm

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Jkl (talk | contribs) at 21:02, 16 August 2010. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

This article does not cite any sources. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Mark–compact algorithm" – news · newspapers · books · scholar · JSTOR (March 2007) (Learn how and when to remove this message)

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 Microsoft's Common Language Runtime and by the Glasgow Haskell Compiler.

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=379283176"

Hidden categories: