Efficient C++ Multithreading: Modern Concurrency Optimization

by David Spuler

Optimize modern C++ multithreading applications using techniques for time and space reduction. Analyze concurrent workloads to reduce synchronization overhead, then optimize the sequential C++ code blocks as well!

Table of
Part Optimization Techniques
1. Multithreading Optimizations
2. Common Bugs & Slugs
3. Thread Overhead
4. Fine-Grained vs Coarse Locking
5. Core Pinning
6. Lock Contention
7. Atomics & Memory Orders
8. False Sharing
Part Multithreaded Data Structures
9. Standard Container Multithreading
10. Lock-Free Data Structures
11. Thread Pools
12. Order of Insertion
13. LRU Cache Data Structure
14. Fast Ring Buffers
15. Parallel Data Structures
Part Memory Access Optimizations
16. Cache Locality
17. Cache Warming
18. Branch Prediction
19. Smart Pointers
20. Contiguous Memory Blocks
21. Pointer Arithmetic
22. Memory Pool Optimizations
23. Memory Optimizations
Part Sequential Code Optimizations
24. Low Latency Programming
25. Compile-Time Optimizations
26. Bitwise Operations
27. Floating-Point Arithmetic
28. Move Semantics
29. Closures, Lambdas and Functors
30. Arithmetic Optimizations
31. Loop Optimizations
32. Algorithm Speedups
33. AVX SIMD Vectorization
34. Parallel Vectorization
35. Slowpath Removal
36. Timing and Benchmarking
37. C++ Slug Catalog

463 pages, Kindle Edition

Published May 27, 2025