FlexHeap: Dynamic I/O-Aware Heap Resizing for Managed Applications
Open Access
- 8 June 2026
- journal article
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 10 (PLDI) , 5-28
Abstract
Popular JVM-based search and analytics systems, such as Elasticsearch and Spark, rely on the OS page cache (I/O cache) to accelerate storage access. However, dividing memory between the JVM heap and the I/O cache creates a trade-off: enlarging the heap reduces garbage collection (GC) overhead but starves the I/O cache, while shrinking it improves I/O performance but raises GC cost. Existing heap resizing mechanisms ignore I/O and thus fail to address this trade-off, resulting in inefficient memory utilization and degraded performance. In this paper, we propose FlexHeap, a heap resizing mechanism for Garbage First (G1), the default OpenJDK garbage collector, that dynamically partitions a fixed DRAM budget between the JVM heap and the I/O cache. Between GC intervals, it estimates the CPU time lost to GC and to I/O stalls and repartitions DRAM to reduce their combined cost. FlexHeap relies on three concepts: (1) It makes resizing decisions using G1 collection boundaries. (2) It uses a history-based approach to estimate the cost of GC and I/O stalls for the future intervals. (3) It uses an adaptive resizing step that scales with changes in the combined cost. We implement FlexHeap in OpenJDK 21’s G1 garbage collector and evaluate it on two widely used systems: the Elasticsearch search engine and the Spark analytic framework. Compared to the G1 heap resizing mechanism, FlexHeap improves performance by an average of 30% in Elasticsearch and by an average of 33% in Spark. It outperforms Vertical G1, a state-of-the-art enhancement to the default G1 heap resizing mechanism, that returns unused memory to the OS eagerly, by 50% on average in throughput, demonstrating that JVM heap resizing needs to consider I/O overhead in search and analytics applications.Keywords
Funding Information
- AERO (101092850)
- EUPEX (101033975)
- VMware’s University Research Fund (11535)
This publication has 32 references indexed in Scilit:
- HugeMap: Optimizing Memory-Mapped I/O with Huge Pages for Fast Storage2021
- A page fault equation for dynamic heap sizing2010
- Modeling, analysis and throughput optimization of a generational garbage collector2009
- Isla Vista Heap Sizing: Using Feedback to Avoid Paging2007
- Sizing multi-space in heap for application isolation2006
- Controlling garbage collection and heap growth to reduce the execution time of Java applicationsACM Transactions on Programming Languages and Systems, 2006
- Program-level adaptive memory management2006
- Automatic heap sizing2004
- Garbage-first garbage collection2004
- Garbage collection in an uncooperative environmentSoftware: Practice and Experience, 1988