Lecture 14: Dynamic Memory Management
Recall Memory Layout for Compiled Program
- we discuss how to manage the heap (dynamicaly allocated memory)
- essential for building structures such as linked lists, trees
- implementation of 'new'
- contrast to stack
Generational Garbage Collectors
Incremenatal Garbage Collectors
Compiler Interface to Garbage Collector
Reference
- Tiger book, Chapter 13