New Full GC for Parallel GC

I'd like to explore a new algorithm for ParallelGC's full GC. The current implementation is too rigid and can not accomodate Lilliput2's Identity Hash-Code, which requires that object can be expanded by 1 word when the object moves.