Skip to main content
Interactive 3D/Spark Partition and Shuffle
Map Phase
Shuffle (Network)
Reduce Phase
Worker 1
Worker 2
Worker 3
Worker 4
Reducer 1
waiting...
Reducer 2
waiting...
Reducer 3
waiting...
Reducer 4
waiting...
Spark Shuffle
Total blocks80
Shuffle bytes0.0 KB
Shuffle time-
Shuffle is Spark's most expensive operation - all data with the same key must move to the same reducer. Data skew (one key having much more data) kills parallelism.

Spark Partition and Shuffle - Interactive Visualization

The shuffle phase in Spark moves data across the network so all records with the same key land on the same reducer. It is the single most expensive operation in distributed data processing. This visualization shows 4 mappers partitioning data and sending it across the network to the correct reducers - and what happens when one key has far more data than others (data skew).

  • Watch data blocks fly from mappers to reducers across the network in the shuffle phase
  • Toggle data skew to see one reducer overwhelmed while others sit idle
  • Understand why shuffle bytes = the cost of a Spark job
  • See how partition count affects parallelism and reducer load balance
  • Foundation for understanding distributed training (AllReduce, parameter server, FSDP)
  • Used in: ML feature engineering at scale, ETL pipelines, model evaluation on large datasets

Part of the EngineersOfAI Interactive 3D - free interactive visualizations covering every major concept in machine learning and AI engineering. Hover any element for a plain-English explanation. No code required.