Fast Incremental GC under High Heap Residency

msra(2006)

引用 23|浏览22
暂无评分
摘要
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 de- crease 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 hy- brid 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.
更多
查看译文
关键词
garbage collector,reference counting,cost analysis
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要