Please use this identifier to cite or link to this item:
|Title:||An equation-based Heap Sizing Rule||Authors:||Tay, Y.C.
|Issue Date:||2013||Citation:||Tay, Y.C., Zong, X., He, X. (2013). An equation-based Heap Sizing Rule. Performance Evaluation 70 (11) : 948-964. ScholarBank@NUS Repository. https://doi.org/10.1016/j.peva.2013.05.009||Abstract:||For garbage-collected applications, dynamically-allocated objects are contained in a heap. Programmer productivity improves significantly if there is a garbage collector to automatically deallocate objects that are no longer needed by the applications. However, there is a run-time performance overhead in garbage collection, and this cost is sensitive to heap size H: a smaller H will trigger more collection, but a large H can cause page faults, as when H exceeds the size M of main memory allocated to the application. This paper presents a Heap Sizing Rule for how H should vary with M. The Rule can help an application trade less page faults for more garbage collection, thus reducing execution time. It is based on a Heap-Aware Page Fault Equation that models how the number of page faults depends on H and M. Experiments show that this rule outperforms the default policy used by JikesRVM's heap size manager. Specifically, the number of faults and the execution time are reduced for both static and dynamically changing M. © 2013 Elsevier B.V. All rights reserved.||Source Title:||Performance Evaluation||URI:||http://scholarbank.nus.edu.sg/handle/10635/102834||ISSN:||01665316||DOI:||10.1016/j.peva.2013.05.009|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.