Understand the underlying theory behind automatic memory management and garbage collection.
About This Video
- Learn about various GC algorithms, such as Mark-Compact collector and Reference counting collector
- Identify the difference between tracing and direct collectors
- Learn about Tri-color abstraction and marking
Memory leaks and dangling pointers are the main issues of manual memory management. If you delete a parent node in a linked list, forgetting to delete all its children first—your memory is leaking. You delete an object chain in the correct order but suddenly, your program crashes since you forgot about the second owner of this resource, which now tries to dereference a null-pointer.
To avoid these issues, most modern high-level programming languages implement automatic memory management. You allocate objects manually; however, don’t bother with their deallocation: a special program, garbage collector, knows how to automatically deallocate them correctly and reclaim for future reuse.
In this course, we’ll study all the different techniques and algorithms related to automatic memory management, which are used today in practice.
Table of contents
- Chapter 1 : Memory Management
- Chapter 2 : Garbage Collectors
- Chapter 3 : Advance Topics
- Chapter 4 : Extras
- Title: Garbage Collection Algorithms
- Release date: March 2021
- Publisher(s): Packt Publishing
- ISBN: 9781801074629
You might also like
Hands-On Machine Learning with Scikit-Learn, Keras, and TensorFlow, 2nd Edition
Through a series of recent breakthroughs, deep learning has boosted the entire field of machine learning. …
Grokking Algorithms Video Edition
"This book does the impossible: it makes math fun and easy!" Sander Rossel, COAS Software Systems …
Data Science from Scratch, 2nd Edition
To really learn data science, you should not only master the tools—data science libraries, frameworks, modules, …
Expanded Edition (August 2018) Updated with Design Patterns episodes from the Clean Code series from Clean …