Robots Atlas>ROBOTS ATLAS
Training

Synchronous Training

2017ActivePublished: 8 May 2026Updated: 8 May 2026Published
Key innovation
All workers process the same SGD step in lockstep and aggregate gradients via all-reduce, making distributed training mathematically equivalent to single-node SGD on a large minibatch.
Category
Training
Abstraction level
Paradigm
Operation level
TrainingSystem
Use cases
LLM training (GPT, LLaMA, Claude, Gemini) on thousands of GPUsComputer vision (ResNet, ViT) at ImageNet scale and beyondReinforcement learning with massive parallel rolloutsProduction-scale recommendation modelsMultimodal foundation models

How it works

Training step: (1) Each of N workers receives a B/N shard of the minibatch and runs forward + backward on a local copy of the model. (2) All workers issue an all-reduce on the gradient buffer (typically ring all-reduce in NCCL/MPI or tree-reduce on a hierarchy). (3) When the collective completes, every worker holds an identical sum/mean of gradients. (4) The local optimizer (Adam, SGD) updates the weights โ€” because all replicas started identical and received identical gradients, the weights stay in sync without further communication. FSDP/ZeRO add extra all-gather and reduce-scatter operations to shard optimizer state, gradients, and parameters.

Problem solved

Training large models on a single GPU is infeasible due to time and memory limits. Asynchronous parameter-server schemes scale poorly because of stale gradients. Synchronous training solves both while preserving convergence equivalent to single-node SGD on a large minibatch.

Implementation

Implementation pitfalls
StragglersHigh

The slowest worker (e.g., GPU thermal throttling or a failing NIC) delays the whole step โ€” risk grows with cluster size.

Fix:Backup workers, elastic training, redundant replicas, and per-host monitoring.
Large-batch generalization gapMedium

Very large global batches (>32k) can degrade generalization despite maintained training convergence.

Fix:Linear LR scaling + warmup, LARS/LAMB optimizers, and label smoothing.
Communication bottleneckHigh

All-reduce time scales with the number of nodes; for small models, communication can dominate compute.

Fix:Gradient compression, compute/communication overlap (PyTorch DDP bucketing), and a high-bandwidth interconnect (RoCE, InfiniBand, NVLink).
Failure recoveryCritical

A single GPU/node failure in classic sync training forces a restart from checkpoint โ€” in 10k+ GPU clusters MTBF is on the order of hours.

Fix:Frequent checkpointing, async checkpointing (e.g. PyTorch DCP), and elastic training (TorchElastic).

Evolution

Original paper ยท 2017 ยท arXiv (Facebook AI Research tech report) ยท Priya Goyal
Accurate, Large Minibatch SGD: Training ImageNet in 1 Hour
Priya Goyal, Piotr Dollรกr, Ross Girshick, Pieter Noordhuis, Lukasz Wesolowski, Aapo Kyrola, Andrew Tulloch, Yangqing Jia, Kaiming He
2012
DistBelief (Google) โ€” early parameter server

Dean et al. introduce the asynchronous parameter server as the first distributed deep-learning architecture.

2017
Goyal et al. โ€” synchronous training on 256 GPUs
Inflection point

Linear scaling rule + warmup enable training ImageNet in 1h on 256 GPUs. Establishes synchronous training as the standard.

2017
Horovod (Uber)

Sergeev & Del Balso release Horovod โ€” a synchronous training framework based on ring all-reduce with NCCL/MPI.

2019
ZeRO (DeepSpeed) โ€” optimizer state partitioning
Inflection point

Rajbhandari et al. introduce ZeRO, reducing memory by sharding optimizer state, gradients, and parameters (stage 1/2/3).

2022
PyTorch FSDP โ€” stable release

Fully Sharded Data Parallel (a ZeRO-3 port into PyTorch core) becomes the dominant LLM training mechanism.

2024
Training on 100k+ GPUs

xAI Colossus, Meta Llama 3, and OpenAI GPT-4 are trained on 25-100k+ GPU clusters using synchronous SGD with RoCE/IB scale-out.

Hyperparameters (configurable axes)

Number of workers (N)Critical

Number of GPUs/TPUs participating in training. Scales the global minibatch and demands linear LR scaling.

8 (single node)
256 (Goyal et al. 2017)
10000+ (frontier LLMs)
Global batch sizeCritical

Total minibatch B = per_worker ร— N. Too large causes a generalization gap.

All-reduce algorithmHigh

Ring vs tree vs hierarchical (NVLink+IB) all-reduce. Affects scaling and topology tolerance.

Gradient accumulation stepsHigh

Micro-batches accumulated before all-reduce โ€” emulates a larger effective batch under memory constraints.

Execution paradigm

Primary mode
Dense

All workers perform exactly the same operations at every step โ€” no conditional execution at the system level.

Activation pattern
All paths active

Parallelism

Parallelism level
Fully parallel
Scope
TrainingAcross devices
Constraints
!Each step ends with an all-reduce โ€” the slowest worker (straggler) blocks the entire cluster.
!All-reduce time dominates when the interconnect has high latency โ€” hence the need for RDMA/InfiniBand/RoCE.

Hardware requirements

Primary

Synchronous training is the primary workload of NVIDIA H100/H200/B200 clusters with NVLink + InfiniBand/RoCE.

Primary

Google TPU pods are built around synchronous training with a dedicated ICI all-reduce fabric.