How to detect memory leaks using heapdump, snapshots, and profiler in nodejs/react/javascript and V8 engine
What you'll learn
- How to detect memory leaks in React/Javascript/Nodejs/V8
- How the memory is orgnised in V8
- How to use heapdump
- How to take memory snapshots
- How to use chrome developer tools to profile your application
- How to write code that will help you find leaks instead of hiding them
- How to read memory snapshots
Requirements
- nodejs
- javascript
- chrome tools
Description
Detect memory leaks like a pro. In this course, you will learn how to connect monitoring to your application, how to take memory snapshots and most importantly, how to compare them with each other to find leaks.You will learn how memory is organized in V8, why short-lived objects are best, and how to write code that will help you find potential memory leaks.
You will learn how to write code that should not contain any leaks, how to find existing ones, and how to write memory-efficient applications.
The entire course is based on nodejs, but these rules can be used in any language that uses the garbage collector.
We will discuss the algorithms that the V8 uses, how long it takes to free memory.
We will also cover what is included in a memory snapshot, what is contaiment, summary, and how to work with comparing them to each other.
Effective and trouble-free operation of the application is work on many levels, thanks to this course one of them will be explained and I hope it will become a little more friendly at a time when conscious memory management has gone into the background, thanks to such a great tool as GC. However, he himself is not always able to fix everything, sometimes he needs a little help.
This is why this course was created.
I belive that together we can save a lot of memory!
Who this course is for:
- Node js/javascript programmers that are concerend about memory efficency of their application
- Node js/javascript programmers that want to improve performance of their applications by reducing the memory usage
