Description
Garbage Collection Algorithms, a training course on memory recycling (garbage collection) has been published by Udemy Academy. Memory leaks and dangling pointers are major issues with manual memory management. You delete a parent node in a linked list, forget to delete all its children first – and you’re leaking memory. You delete an object chain in the correct order, but suddenly your program crashes because you forgot the second owner of this resource and now tries to address a null-pointer. To avoid these issues, most modern high-level programming languages implement automatic memory management. You allocate objects manually, but don’t worry about moving them: a special program, the garbage collector, knows how to automatically move them correctly, for future reuse. to recover
In the Garbage Collectors course, we examine all the different techniques and algorithms related to automatic memory management that are used in practice today. In your programming language implementation, there is a very high probability that you will need to implement a garbage collector. Even languages that were initially classified as “memory safe”, such as Rust, eventually implemented automatic reference counting (ARC) and other accumulators. In most modern high-level programming languages, a garbage collector module (or multiple GC modules, such as Java) is essential today. If you are not a compiler engineer, the course may still be of interest to you. Implementing a garbage collector, or a memory manager in general, is a very advanced engineering task.
What you will learn
- Algorithms and data structures behind automatic memory management in computer programs.
- History of memory management: Static, Stack, Heap allocations
- Virtual memory and memory login
- Tracking Vs. Direct collectors
- Semantics vs. Synthetics
- Garbage collector Mark-Sweep
- Collector Mark– Compact
- Reference count adder
- Copied from the collector
- A generational collector
- Parallel, incremental and concurrent adders
- Abstraction and notation Tri– color
- GC limitation
Who is this course suitable for?
- Compiler engineers
- All curious engineers, willing to run a complex project to learn different memory management algorithms (general knowledge transferable to other systems)
Garbage Collection Algorithms course specifications
- Publisher: Udemy
- teacher : Dmitry Soshnikov
- English language
- Education level: Intermediate
- Number of courses: 17
- Training duration: 2 hours and 13 minutes
Head of the course chapters on 2021-3
Course prerequisites
- Basic data structures and algorithms (trees, graphs, linked lists, etc.)
- Basic knowledge about computer memory (bytes, addresses, pointers)
Pictures
Sample video
Installation guide
After Extract, view with your favorite Player.
English subtitle
Quality: 720p
download link
File(s) password: www.downloadly.ir
Size
426 MB
Be the first to comment