Dynamic pretenuring schemes for generational garbage collection

Wei Huang, W. Srisa-an, J. M. Chang
{"title":"Dynamic pretenuring schemes for generational garbage collection","authors":"Wei Huang, W. Srisa-an, J. M. Chang","doi":"10.1109/ISPASS.2004.1291365","DOIUrl":null,"url":null,"abstract":"Previous research efforts have shown that pretenuring can potentially reduce the copying cost by creating long lived objects into the mature memory regions directly. To date, researchers often employ profiling and static analysis to accurately select the objects that should be pretenured. However, little research efforts have been spent on dynamic approaches for pretenuring objects. In this paper, we propose a novel approach that dynamically predicts object lifespan to assist with pretenuring selection. The proposed scheme performs dynamic pretenuring selection based on a feedback mechanism that records lifespan of objects from each class during garbage collection invocations. This information is then used to pretenure objects in subsequent allocation requests. We experiment with two approaches, jumpstart feedback and continuous feedback, to collect tenuring information. The experimental results of selected benchmark programs show that our schemes can improve the garbage collection time of IBM's Jikes RVM by up to 37%, and improve the overall execution time by up to 28%.","PeriodicalId":188291,"journal":{"name":"IEEE International Symposium on - ISPASS Performance Analysis of Systems and Software, 2004","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Symposium on - ISPASS Performance Analysis of Systems and Software, 2004","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPASS.2004.1291365","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18

Abstract

Previous research efforts have shown that pretenuring can potentially reduce the copying cost by creating long lived objects into the mature memory regions directly. To date, researchers often employ profiling and static analysis to accurately select the objects that should be pretenured. However, little research efforts have been spent on dynamic approaches for pretenuring objects. In this paper, we propose a novel approach that dynamically predicts object lifespan to assist with pretenuring selection. The proposed scheme performs dynamic pretenuring selection based on a feedback mechanism that records lifespan of objects from each class during garbage collection invocations. This information is then used to pretenure objects in subsequent allocation requests. We experiment with two approaches, jumpstart feedback and continuous feedback, to collect tenuring information. The experimental results of selected benchmark programs show that our schemes can improve the garbage collection time of IBM's Jikes RVM by up to 37%, and improve the overall execution time by up to 28%.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
分代垃圾收集的动态假装方案
先前的研究表明,假装可以通过直接在成熟的记忆区域中创建长期存在的对象来潜在地降低复制成本。迄今为止,研究人员经常使用分析和静态分析来准确地选择应该假装的对象。然而,很少有研究努力花在动态方法假装对象。在本文中,我们提出了一种新的方法,动态预测对象寿命,以协助假装选择。该方案基于反馈机制执行动态预估选择,该机制在垃圾收集调用期间记录来自每个类的对象的生命周期。然后,该信息用于在随后的分配请求中预占有对象。我们尝试了两种方法,即快速反馈和持续反馈,来收集终身教职信息。所选基准程序的实验结果表明,我们的方案可以将IBM的Jikes RVM的垃圾收集时间提高37%,并将总体执行时间提高28%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Sockets Direct Protocol over InfiniBand in clusters: is it beneficial? Eccentric and fragile benchmarks Cache implications of aggressively pipelined high performance microprocessors Performance evaluation of exclusive cache hierarchies The future of simulation: A field of dreams
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1