ABSTRACT
The design and analysis of fast sliding compaction GC (Garbage Collection) called FSC is presented and its implementation on PHL (Portable Hash Lisp) is reported. FSC is “stop-and-collect” type GC and adopts a fast pointer adjustment scheme and O(A) time compaction scheme using a sorting technique, where A is all object size in use. FSC has the excellent features such as: (1) it performs sliding compaction fastest among most known sliding compaction GC, (2) it requires an additional space less than a thirty-second part of a heap, (3) it is applied to “generation”. FSC has been successfully implemented on PHL being ported to many machines. The performance evaluation of different GC schemes obtained from experimental data shows excellence of FSC such that the time ratio of FSC to copying collection GC is ordinarily within 1.5.
