Live heap space analysis for languages with garbage collection
Live heap space analysis for languages with garbage collection
复制标题
具有垃圾收集功能的语言的实时堆空间分析
DOI：
10.1145/1542431.1542450
复制
发表时间：
2009
期刊：
影响因子：
--
通讯作者：
M. Gómez
中科院分区：
文献类型：
--
作者：
E. Albert;S. Genaim;M. Gómez
程序的峰值堆消耗是程序执行期间堆上活动数据的最大大小，也就是说，在不耗尽内存的情况下运行程序所需的最小堆空间。众所周知，垃圾收集（GC）使得预测运行程序所需的内存变得困难。本文介绍了我们所知的第一个针对垃圾收集语言的实时堆空间分析，它可以推断出程序执行时峰值堆使用的准确上界，而不受任何复杂性类的限制，即我们可以推断指数，对数，多项式等边界。我们的分析是针对一种（顺序的）面向对象的字节码语言开发的，这种语言具有一个作用域内存管理器，当方法返回时，它可以回收不可访问的内存。我们还展示了我们的分析如何适应其他更接近理想GC的GC方案，即在对象不可访问时立即收集它们。我们的方法的实用性在一个原型实现上进行了实验评估。我们通过推断一组标准化基准测试（JOlden套件）的实时堆空间界限来证明它是全自动的、相当准确和高效的。
The peak heap consumption of a program is the maximum size of the live data on the heap during the execution of the program, i.e., the minimum amount of heap space needed to run the program without exhausting the memory. It is well-known that garbage collection (GC) makes the problem of predicting the memory required to run a program difficult. This paper presents, the best of our knowledge, the first live heap space analysis for garbage-collected languages which infers accurate upper bounds on the peak heap usage of a program's execution that are not restricted to any complexity class, i.e., we can infer exponential, logarithmic, polynomial, etc., bounds. Our analysis is developed for an (sequential) object-oriented bytecode language with a scoped-memory manager that reclaims unreachable memory when methods return. We also show how our analysis can accommodate other GC schemes which are closer to the ideal GC which collects objects as soon as they become unreachable. The practicality of our approach is experimentally evaluated on a prototype implementation. We demonstrate that it is fully automatic, reasonably accurate and efficient by inferring live heap space bounds for a standardized set of benchmarks, the JOlden suite.
DOI：
10.1145/1375634.1375656
发表时间：
2008-06
期刊：
--
影响因子：
--
作者：
W. Chin;Huu Hai Nguyen;C. Popeea;S. Qin
通讯作者：
W. Chin;Huu Hai Nguyen;C. Popeea;S. Qin