Learning When to Garbage Collect with Random Forests
Generational garbage collectors are one of the most common types of automatic memory management. We can minimize the costs they incur by carefully choosing the points in a program's execution at which they run. However, this decision is generally based on simple, crude heuristics. Instead, we train random forest classifiers to decide when to collect based on features gathered from a running program. This reduces the total cost of collection in both time and space. We demonstrate useful generalization of learned policies to unseen traces of the same program, showing this approach may be fruitful for further investigation.
Sun 23 Jun Times are displayed in time zone: Tijuana, Baja California change
11:20 - 12:35
|Exploration of Memory Hybridization for RDD Caching in Spark|
|Learning When to Garbage Collect with Random Forests|
|Timescale Functions for Parallel Memory Allocation|