Metraipolis › archive › dc_41973bd15104
Opportunistic ZGC: Leveraging Idle Cores for More Effective Concurrent Garbage Collection — arXiv:2609.15558
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.15558
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T23:17:50.882Z
- SHA-256 of the archived text
9bcd6de826d71be27654b07f2aa44e3a8ee96d72f1211bd9d7b60720099611c2- Stable URL of this page
https://metraipolis.com/documento/dc_41973bd15104
How to cite
Opportunistic ZGC: Leveraging Idle Cores for More Effective Concurrent Garbage Collection — arXiv:2609.15558 — arXiv (en), https://arxiv.org/abs/2609.15558 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_41973bd15104 (Metraipolis archive dc_41973bd15104, sha256 9bcd6de826d71be27654b07f2aa44e3a8ee96d72f1211bd9d7b60720099611c2)
BibTeX
@misc{dc41973bd15104,
title = {Opportunistic ZGC: Leveraging Idle Cores for More Effective Concurrent Garbage Collection — arXiv:2609.15558},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.15558},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_41973bd15104; sha256 9bcd6de826d71be27654b07f2aa44e3a8ee96d72f1211bd9d7b60720099611c2},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.15558. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Managed language runtimes often provide concurrent garbage collectors so that latency-critical applications with large working sets can keep running while most collection work proceeds in the background. ZGC is a production-quality, generational, concurrent collector in OpenJDK with sub-millisecond pause times. While ZGC is designed to run concurrently, frequent and excessive collections with ZGC can still slow the mutators due to synchronization costs and interference with shared computing resources. Hence, the ZGC scheduler is conservative by default, and in most cases, will grow the heap toward the maximum allowed before scheduling a collection. While this approach minimizes collection effort, it can be wasteful, or even harmful, if the maximum heap size is not well tuned to the actual working set. We propose Opportunistic ZGC (OppZGC), a feedback-directed ZGC scheduling policy that constrains the heap dynamically and automatically, without per-application tuning. OppZGC identifies periods when CPU cores are underutilized and leverages them for concurrent collection with ZGC. We describe the design and implementation of OppZGC in OpenJDK's HotSpot Java VM and evaluate it with standard and latency-sensitive benchmarks from DaCapo Chopin and SPECjbb. OppZGC limits heap usage when there is CPU capacity sufficient for additional collections, and avoids scheduling extra collections when they would substantially degrade performance. Overall, it reduces maximum heap usage for our DaCapo benchmarks by between 61% and 90%, on average, depending on configuration, with minimal impact on throughput and request latency compared to default ZGC. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-15 in cs.DC). Categorie arXiv: Programming Languages (cs.PL) ; Distributed, Parallel, and Cluster Computing (cs.DC); Performance (cs.PF). Pagina del lavoro: https://arxiv.org/abs/2609.15558 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-15T22:54:13.022Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).