Opening Storage Allocation and Garbage Collection
Storage Allocation and Garbage Collection
- Length
- 59 min
- Level
- Undergraduate
- Recorded
- MIT2019
Chapter 1 of 6: Representation of data structures
Details memory management, mark-sweep and copying garbage collection, and proves the halting theorem.
MIT 6.001 session 16 covers storage allocation and garbage collection in Lisp at the undergraduate level. Abelson and Sussman represent cons cells in linear memory, allocate them from a free list, and compare mark-sweep with copying collection.
MIT 6.001 session 16 covers storage allocation and garbage collection in Lisp at the undergraduate level. Abelson and Sussman represent cons cells in linear memory, allocate them from a free list, and compare mark-sweep with copying collection.
This lecture
Lecture 16 of 21 of Structure and Interpretation of Computer Programs (SICP).
Choose a node to see how it connects to this lecture. What comes before is on the leftat the top. What comes after is on the rightat the bottom. The ring is what it teaches. People and places are above.
Press a chosen node again to open it.
Your comment is kept while you sign up.Sign in