๐Ÿงต C++ Concurrency and Parallelism
Home Chapters Examples Diagrams Bibliography GitHub โ†—
  1. Home
  2. Parallelism and Throughput
Part 4 4 chapters

Parallelism and Throughput

Parallel algorithms and execution policies, thread pools, NUMA and affinity, and SIMD data parallelism.

Doc 14

Parallel Algorithms and Execution Policies

The standard execution policies, the parallel STL algorithms built on them, C++26 additions, and when parallel execution actually pays off.

15 minRead โ†’
Doc 15

Thread Pools and Work Scheduling

Sizing a thread pool correctly, work-stealing task queues, bounded queues and back-pressure, and the cgroup-aware sizing a pool needs to behave inside a container.

16 minRead โ†’
Doc 16

NUMA, Affinity, and Data Locality

CPU pinning and affinity, NUMA-aware allocation, the latency gap between local and remote memory, and how cpuset constraints interact with it.

15 minRead โ†’
Doc 17

SIMD and Data Parallelism

Vectorization fundamentals, what defeats autovectorization, the upcoming C++26 std::simd, and the data layout choices that make vectorization possible in the first place.

15 minRead โ†’
โ† Previous part Tasks, Futures, and Asynchrony Next part โ†’ Low Latency and High Throughput
C++ Concurrency and Parallelism
Tutorial content: CC BY 4.0. Sample code: Apache 2.0.
Source on GitHub โ†—  ยท  File an issue โ†—