Affiliation:
1. Computer Science Division, Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, California
Abstract
Many interactive computing environments provide automatic storage reclamation and virtual memory to ease the burden of managing storage. Unfortunately, many storage reclamation algorithms impede interaction with distracting pauses.
Generation Scavenging
is a reclamation algorithm that has no noticeable pauses, eliminates page faults for transient objects, compacts objects without resorting to indirection, and reclaims circular structures, in one third the time of traditional approaches.
We have incorporated
Generation Scavenging
in Berkeley Smalltalk(BS), our Smalltalk-80 implementation, and instrumented it to obtain performance data. We are also designing a microprocessor with hardware support for
Generation Scavenging
.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Cited by
109 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Evaluating Finalization-Based Object Lifetime Profiling;Proceedings of the 2024 ACM SIGPLAN International Symposium on Memory Management;2024-06-20
2. A Comprehensive Study on Different Optimizations of Pure Reference Counting Garbage Collectors;2023 International Conference on Computational Intelligence, Networks and Security (ICCINS);2023-12-22
3. Collecting Cyclic Garbage across Foreign Function Interfaces: Who Takes the Last Piece of Cake?;Proceedings of the ACM on Programming Languages;2023-06-06
4. Heap Fuzzing: Automatic Garbage Collection Testing with Expert-Guided Random Events;2023 IEEE Conference on Software Testing, Verification and Validation (ICST);2023-04
5. Ease Virtual Machine Level Tooling with Language Level Ordinary Object Pointers;Proceedings of the 14th ACM SIGPLAN International Workshop on Virtual Machines and Intermediate Languages;2022-11-29