Writing Cache-Friendly C++
summary
Shows that memory layout is the main determinant of C++ performance by measuring a custom memory-access benchmark and using sampling/instrumentation to compare std::vector versus alternative data layouts. Presents concrete techniques — contiguous storage, allocation strategies, prefetching and cache-line-aware organization — and reports empirical throughput numbers that highlight large latency jumps when the working set crosses cache levels.
AI-written summary · about
chapters (7)
- 0:00Introduction
- 12:45CPU caches overview
- 24:40Linear access and containers
- 35:57Cache misses explained
- 43:07Data design pitfalls
- 48:37Cache optimization pitfalls
- 51:02Summary
related talks
01h 00mCache Friendly C++
58mC++ Performance and Optimisation
01h 00mMoving Faster: Everyday efficiency in modern C++
01h 01mRefresher on Containers, Algorithms and Performance in C++
01h 05mFast and small C++ - When efficiency matters
01h 00m“Want fast C++? Know your hardware!"
01h 01mWhat do you mean by "Cache Friendly"?
01h 01mFaster, Easier, Simpler Vectors