liveBook · Manning

Parallel compounding

As explained in Latency

Parallel compounding is the accumulation of latency when independent components execute concurrently and completion depends on the slowest component.

Parallel compounding occurs when independent components execute concurrently but total latency remains governed by the slowest component. Partitioning work enables lower latency, while increasing fan-out raises exposure to tail latency. section 2.4

MapReduce

MapReduce parallelizes its map phase because each output depends only on one input partition. The reduce phase gathers intermediate values, so job latency follows the slowest map task and becomes more variable as fan-out increases. section 2.4

Use parallel compounding deliberately:

  • Partition work only when tasks are independent. section 2.4
  • Measure latency variability, not only average component speed. section 2.4
  • Distinguish parallel compounding from quorum compounding, which waits for a majority rather than every component. section 2.4

How Latency covers it

How deep it goes
Explains the definition, MapReduce mechanism, slowest-task constraint, and tail-latency trade-off without implementation details.
Examples
Uses MapReduce map and reduce phases to demonstrate partitioning, fan-out, and slowest-task latency.
What you can do after
Apply it via MapReduce-style partitioning while evaluating slowest-task latency and variability.
How it connects
Connects parallel compounding to serial compounding, MapReduce, tail latency, SIMD, and quorum compounding.

Related concepts

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