Mark–compact algorithm

<p>
In <a href="/facts/Computer_science/lN3pEyPz">computer science</a>, a mark–compact algorithm is a type of <a href="/facts/Garbage_collection_(computer_science)/j2vlIu7g">garbage collection</a> <a href="/facts/Algorithm/fnl5NmRt">algorithm</a> used to reclaim <a href="/facts/Unreachable_memory/RUTD75R9">unreachable memory</a>. Mark–compact algorithms can be regarded as a combination of the <a href="/facts/Mark%25E2%2580%2593sweep_algorithm/qg7fK6w9">mark–sweep algorithm</a> and <a href="/facts/Cheney%2527s_algorithm/os1f0IpL">Cheney's copying algorithm</a>. 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 <a href="/facts/Java_virtual_machine/l9Nzrsun">JVMs</a>, <a href="/facts/Microsoft/nGIDDXdx">Microsoft</a>'s <a href="/facts/Common_Language_Runtime/4Y0cUdkd">Common Language Runtime</a> and by the <a href="/facts/Glasgow_Haskell_Compiler/4msB3KFN">Glasgow Haskell Compiler</a>.
</p>

Mark–compact algorithm open-in-new

Mark–compact algorithm