Fast Incremental GC under High Heap Residency

†† † The performance of garbage collectors (GC) is generally evaluated by its throughput and pause time. We propose an incremental collector scheme that suppresses the throughput decrease caused by increase in heap residensy. To achieve this, we design a hybrid collector that combines Incremental Mark-Sweep (IMS) and Reference Counting, then propose a dynamic control method of IMS. Improvement on collection throughput of the proposed dynamic IMS control scheme was shown through theoretical cost analysis. We implemented proposed hybrid GC sheme on Jikes RVM and compared with other GC algorithms. We show proposed collector suppresses the decrease in throughput while it keeps short pause time.