Maximising Throughput & Minimising Latency in High-Performance C++ Code
summary
Shows concrete data layout changes: pull hot fields into separate vectors, replace object-centric loops with struct of arrays vs array of structs transformations, and apply simple vectorized transformations to operate on contiguous memory. Demonstrates a hybrid pattern that keeps useful abstraction while reducing CPU cache misses and improving throughput, explains when the cache utilization wins justify extra implementation complexity, and gives practical before-and-after code patterns and tradeoffs for low-latency C++ systems.
AI-written summary · about
chapters (9)
- 0:00Intro: Why Performance Matters
- 0:24Real-World Impact of Latency
- 1:03Common C++ Data Modeling Patterns
- 1:54Why Standard Object-Oriented Design Slows You Down
- 2:22Pull-Based Transformation: Pros and Cons
- 3:05A Hybrid Performance-First Approach
- 3:54Optimizing Cache Usage with Vectorized Data
- 4:36Takeaways on Data, Hardware, and Simplicity
- 4:57Closing Thoughts
related talks
01h 00mMoving Faster: Everyday efficiency in modern C++
44mC++ Performance and Optimisation
01h 04mDesign for Performance
35mAlgorithmic and microarchitecture optimizations of C++ applications
57mThis Videogame Programmer Used the STL and You Will Never Guess What Happened Next
49mAlgorithmic and microarchitecture optimizations of C++ applications
21mHPC Green Computing: Relationships Between Throughput and Latency
58mRefresher on Containers, Algorithms and Performance
