Time Matters: Minimizing Garbage Collection Overhead with Minimal Effort
dc.contributor.author | Blaschek, Günther | |
dc.contributor.author | Lengauer, Philipp | |
dc.date.accessioned | 2023-03-13T10:09:58Z | |
dc.date.available | 2023-03-13T10:09:58Z | |
dc.date.issued | 2015 | |
dc.description.abstract | Parameterization of garbage collectors can help improving the overall run time of programs, but finding the best parameter combination is a tedious task. We used a simple brute-force optimization algorithm for the Java Parallel GC to study the behavior of benchmarks with thousands of configurations. As a result of this study, we propose a practically usable strategy for finding a “good” parameter combination with a small number of experiments. Using this strategy, only 10 configurations need to be tested in order to reduce the garbage collection time down to 21% (56% on average). For the studied benchmarks, this results in an overall performance gain of up to 13%. | en |
dc.identifier.pissn | 0720-8928 | |
dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/40781 | |
dc.language.iso | en | |
dc.publisher | Geselllschaft für Informatik e.V. | |
dc.relation.ispartof | Softwaretechnik-Trends Band 35, Heft 3 | |
dc.subject | Memory management (garbage collection) | |
dc.title | Time Matters: Minimizing Garbage Collection Overhead with Minimal Effort | en |
dc.type | Text/Journal Article | |
gi.citation.publisherPlace | Bonn | |
gi.conference.sessiontitle | Sonderteil: Proceedings of the Symposium on Software Performance (SSP) 2015, 4. - 6. November 2015, Munich, Germany |
Dateien
Originalbündel
1 - 1 von 1