C++ Performance and Optimisation

This talk examines C++ performance across CPU and cache behavior, data layout, algorithms and data structures, memory allocation, and move semantics. It connects measurement and optimization choices to domain knowledge and data access patterns.

Syllabus

Intro
The performance story
Overview
Modern CPUs
Instructions are "free", memory b/w isn't
Cache hierarchy
Measurement - Big O notation
Data layout and performance
Vectorisation (2)
Move semantics and rvalue references
Move semantics example
Implementing move semantics
Memory allocations and STL
Optimisation - hash function
Binary search on a sorted collection
Domain knowledge
questions about data access
Non-primary key access
Range scans and sequential access
Read/write ratio
Working set size • How much of the common dan will fit in main
Consistency
Summary