Generation Scavenging
David Ungar · ACM SIGSOFT Software Engineering Notes · 1984
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 .
Cited by 484 works. doi:10.1145/390010.808261
Authors
References
- The Art of Computer Programming
- Smalltalk-80: The Language and its Implementation
- One-Level Storage System
- Recursive functions of symbolic expressions and their computation by machine, Part I
- Recursive Functions of Symbolic Expressions and Their Computation by Machine (1960)
- Virtual memory
- Computer Structures: Principles and Examples
- Virtual Memory
- List processing in real time on a serial computer
- Efficient implementation of the smalltalk-80 system