Overview
Syllabus
Introduction
System Allocators and Allocation Process
The problem of memory fragmentation
Custom allocator for STL containers: example
Solution: Don't allocate objects for communication
Why does the program's speed depend on the memory access patter?
Cache memories - data locality (example)
Cache memories - prefetcher (example)
Cache memories - cache line (example)
Summary: Memory Access Performance
Experiment with class size and member layout
Principles of cache-aware software design (1/4)
Array of values vs array of pointers
Array of pointer performance
Principles of cache-aware software design (2/4)
Small vs Large classes memory layout
Class Size, Data Layout and Performance
Principles of cache-aware software design (3/4)
Binary Tree Example Binary Tree a data structure used for tast lookup to check if the value is
Taught by
CppNow