Jacques Cohen and Alexandru Nicolau. Comparison of compacting algorithms for garbage collection . General references can be found in the surveys just cited. Jacques Cohen and Alexandru Nicolau. Comparison of compacting algorithms for garbage collection .
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. There are two main basic collection techniques. Comparison of Compacting Algorithms for Garbage Collection . ACM Trans. on Prog.