Notice
This is not the latest version of this item. The latest version can be found at:https://dspace.mit.edu/handle/1721.1/132291.3
Learned garbage collection
Author(s)
Cen, Lujing; Marcus, Ryan; Mao, Hongzi; Gottschlich, Justin; Alizadeh, Mohammad; Kraska, Tim; ... Show more Show less
DownloadSubmitted version (363.8Kb)
Open Access Policy
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
© 2020 Owner/Author. Several programming languages use garbage collectors (GCs) to automatically manage memory for the programmer. Such collectors must decide when to look for unreachable objects to free, which can have a large performance impact on some applications. In this preliminary work, we propose a design for a learned garbage collector that autonomously learns over time when to perform collections. By using reinforcement learning, our design can incorporate user-defined reward functions, allowing an autonomous garbage collector to learn to optimize the exact metric the user desires (e.g., request latency or queries per second). We conduct an initial experimental study on a prototype, demonstrating that an approach based on tabular Q learning may be promising.
Date issued
2020-06Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer ScienceJournal
MAPL 2020 - Proceedings of the 4th ACM SIGPLAN International Workshop on Machine Learning and Programming Languages, co-located with PLDI 2020
Publisher
ACM