Affiliation:
1. EECS Department, University of California, Berkeley
Abstract
Much research has been devoted to studies of and algorithms for memory management based on garbage collection or explicit allocation and deallocation. An alternative approach, region-based memory management, has been known for decades, but has not been well-studied. In a region-based system each allocation specifies a region, and memory is reclaimed by destroying a region, freeing all the storage allocated therein. We show that on a suite of allocation-intensive C programs, regions are competitive with malloc/free and sometimes substantially faster. We also show that regions support safe memory management with low overhead. Experience with our benchmarks suggests that modifying many existing programs to use regions is not difficult.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Explicit Effects and Effect Constraints in ReML;Proceedings of the ACM on Programming Languages;2024-01-05
2. Reference Capabilities for Flexible Memory Management;Proceedings of the ACM on Programming Languages;2023-10-16
3. NUMAlloc: A Faster NUMA Memory Allocator;Proceedings of the 2023 ACM SIGPLAN International Symposium on Memory Management;2023-06-06
4. Improving Automatic C-to-Rust Translation with Static Analysis;2023 IEEE/ACM 45th International Conference on Software Engineering: Companion Proceedings (ICSE-Companion);2023-05
5. Concrat: An Automatic C-to-Rust Lock API Translator for Concurrent Programs;2023 IEEE/ACM 45th International Conference on Software Engineering (ICSE);2023-05