liveBook · Manning

Allreduce

As explained in Sutskever's List

An all-reduce operation combines values from multiple computing devices and distributes the combined result to all of them.

In data-parallel training, each GPU holds a copy of the model and processes a different batch. All-reduce combines the replicas’ gradients and makes the result available to every GPU, keeping their models synchronized. section 6.3

DS2 training

Deep Speech 2 (DS2) divided training batches across 8–16 GPUs, then averaged gradients into a synchronized update. Its custom all-reduce routine enabled direct GPU-to-GPU transfers and made one full training pass 2.5 times faster than the standard OpenMPI setup. Adding GPUs roughly halved training time, but communication overhead brought diminishing returns beyond eight devices. section 4.4.2

All-reduce helps data parallelism scale while the full model fits on each device. It does not remove that memory limit: when a model outgrows one GPU, replicating it becomes infeasible, and model parallelism offers a different approach. section 6.3

How Sutskever's List covers it

How deep it goes
Defines gradient summation and synchronization, then notes GPU-transfer engineering and communication overhead without detailing the algorithm.
Examples
Uses DS2 training across 8–16 GPUs and compares its custom routine with standard OpenMPI.
What you can do after
Evaluate communication trade-offs in synchronized multi-GPU training, including diminishing returns as device counts rise.
How it connects
Connects data parallelism, gradients, model replicas, GPU communication, and OpenMPI.

Also explained in

Compare how 4 books explain allreduce →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Sutskever's List. The section links point to the parts of the book it draws on.