Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the concept of copying garbage collection, which involves splitting the heap into two semi-spaces, allocating memory from one space, and copying reachable objects to the other when needed. It explains the benefits and drawbacks of copying GC compared to mark & sweep, introduces Cheney's copying GC, and discusses generational garbage collection and its advantages. The lecture also delves into the challenges of handling inter-generational pointers, the use of remembered sets and card marking, and issues like nepotism in GC. Additionally, it explores features like finalizers, weak references, and different GC techniques such as incremental/concurrent GC and parallel GC.