A Fast Slide Mark Compact Algorithm

Allocation order is the best for locality,which slide mark compact algorithm is based on.But traditional design made the algorithm's overhead too large.We proposed a fast slide mark compact algorithm,which reduces the overhead by mark bit table,live block pool and offset table.The results show that it achieves up to 8.9% speedup in industry-standard benchmark SPEC JVM98 on the Pentium 4,11% improvement in dtlb miss numbers and 13.6% reduce with L2 cache miss numbers.