Any long lived data is repeatedly copied between semi spaces. However, these compaction algorithms are usually considered to be prohibitively expensive, because they require the heap to be sequentially scanned. There are two main basic collection techniques. Comparison of Compacting Algorithms for Garbage Collection . ACM Trans. on Prog.
Every collection copies all live data.
Any long lived data is repeatedly copied between semi spaces. However, these compaction algorithms are usually considered to be prohibitively expensive, because they require the heap to be sequentially scanned. 1.1 Keywords Memory allocation, garbage collection, fragmentation, conservative garbage collection, non copying garbage collection 2. Non moving collectors are unable to move live data, and therefore free memory is interleaved with holes of live memory. Comparison of compacting algorithms for garbage collection .