Video description
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
In Detail
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.
Product information
- Title: Garbage Collection Algorithms
- Author(s):
- Release date: March 2021
- Publisher(s): Packt Publishing
- ISBN: 9781801074629
You might also like
book
Clean Code: A Handbook of Agile Software Craftsmanship
Even bad code can function. But if code isn't clean, it can bring a development organization …
book
40 Algorithms Every Programmer Should Know
Learn algorithms for solving classic computer science problems with this concise guide covering everything from fundamental …
video
Python Fundamentals
51+ hours of video instruction. Overview The professional programmer’s Deitel® video guide to Python development with …
book
Building Microservices, 2nd Edition
Distributed systems have become more fine-grained as organizations shift from code-heavy monolithic applications to smaller, self-contained …