Abstract
Abstract
We present a region-based memory management scheme with support for generational garbage collection. The scheme features a compile-time region inference algorithm, which associates values with logical regions, and builds on a region type system that deploys region types at runtime to avoid the overhead of write barriers and to support partly tag-free garbage collection. The scheme is implemented in the MLKit Standard ML compiler, which generates native x64 machine code. Besides demonstrating a number of important formal properties of the scheme, we measure the scheme’s characteristics, for a number of benchmarks, and compare the performance of the generated executables with the performance of executables generated with the MLton state-of-the-art Standard ML compiler and configurations of the MLKit with and without region inference and generational garbage collection enabled. Although region inference often serves the purpose of generations, combining region inference with generational garbage collection is shown often to be superior to combining region inference with non-generational collection despite the overhead introduced by a larger amount of memory waste, due to region fragmentation.
Publisher
Cambridge University Press (CUP)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Double-Ended Bit-Stealing for Algebraic Data Types;Proceedings of the ACM on Programming Languages;2024-08-15
2. Explicit Effects and Effect Constraints in ReML;Proceedings of the ACM on Programming Languages;2024-01-05
3. Reference Capabilities for Flexible Memory Management;Proceedings of the ACM on Programming Languages;2023-10-16
4. Parallelism in a Region Inference Context;Proceedings of the ACM on Programming Languages;2023-06-06
5. Garbage-Collection Safety for Region-Based Type-Polymorphic Programs;Proceedings of the ACM on Programming Languages;2023-06-06