Completed
Array of values vs array of pointers
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
The Performance Price of Dynamic Memory in C++
Automatically move to the next video in the Classroom when playback concludes
- 1 Introduction
- 2 System Allocators and Allocation Process
- 3 The problem of memory fragmentation
- 4 Custom allocator for STL containers: example
- 5 Solution: Don't allocate objects for communication
- 6 Why does the program's speed depend on the memory access patter?
- 7 Cache memories - data locality (example)
- 8 Cache memories - prefetcher (example)
- 9 Cache memories - cache line (example)
- 10 Summary: Memory Access Performance
- 11 Experiment with class size and member layout
- 12 Principles of cache-aware software design (1/4)
- 13 Array of values vs array of pointers
- 14 Array of pointer performance
- 15 Principles of cache-aware software design (2/4)
- 16 Small vs Large classes memory layout
- 17 Class Size, Data Layout and Performance
- 18 Principles of cache-aware software design (3/4)
- 19 Binary Tree Example Binary Tree a data structure used for tast lookup to check if the value is
