Taming Dynamic Memory - An Introduction to Custom Allocators in C++

Taming Dynamic Memory - An Introduction to Custom Allocators in C++

code::dive conference via YouTube Direct link

Memory leak

8 of 43

8 of 43

Memory leak

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Taming Dynamic Memory - An Introduction to Custom Allocators in C++

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Introduction
  2. 2 The Simpsons
  3. 3 Agenda
  4. 4 What is dynamic memory
  5. 5 Coalescing
  6. 6 Shared Global State
  7. 7 Simpler locator
  8. 8 Memory leak
  9. 9 Runtime properties
  10. 10 Real world examples
  11. 11 STD vector
  12. 12 Nodebased containers
  13. 13 Hashmap
  14. 14 Hashmap extremes
  15. 15 Rehash operation
  16. 16 Why is it hard to guarantee
  17. 17 What happens on the DLL
  18. 18 Padding
  19. 19 Alignment
  20. 20 Natural alignment
  21. 21 Default allocator
  22. 22 Single allocator
  23. 23 Memory reclamation
  24. 24 Auxiliary data structure
  25. 25 Where to store auxiliary notes
  26. 26 Reasons to store auxiliary notes
  27. 27 The bottom line
  28. 28 The pool locator
  29. 29 Chunks
  30. 30 Overwrite
  31. 31 Put something back
  32. 32 Diffusion
  33. 33 Runtime cost
  34. 34 Memory consumption
  35. 35 Multipool
  36. 36 Custom allocators in C
  37. 37 Historical quirk
  38. 38 PMR memory resources
  39. 39 Chaining
  40. 40 Fixed vs Dynamic
  41. 41 Parameters
  42. 42 Global Locator
  43. 43 Wrapup

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.