liveBook · Manning

Throughput

As explained in Latency

Throughput is the rate at which a system processes or transfers units of work or data over time.

Throughput is the actual rate of successful work or message delivery over time. It measures how much data an application transfers or how many requests it processes per time unit. section 1.4

Throughput differs from bandwidth and latency. Bandwidth sets the communication channel’s maximum capacity; latency measures the time for one request to complete. Throughput records the rate the system actually sustains. section 1.4

Laundry as a pipeline

Washing takes 30 minutes and drying takes 60. Running both steps serially gives 90-minute latency and throughput of 1/90 loads per minute. Pipelining overlaps the next wash with drying, increasing throughput to 1/60 loads per minute while making per-load latency 120 minutes and leaving drying as the bottleneck. section 1.5

Figure 1.2 Processing without pipelining. We first perform step W (washing) fully and only then perform step D (drying). As the time to complete W is 30 minutes and the time to complete D is 60 minutes, washing and drying take 90 minutes in total. Therefore, we say that the latency to wash and dry clothes is 90 minutes and the throughput is 1/90 loads of laundry washed and dried per minute.

Compare serial and pipelined processing to see how overlap changes latency, throughput, and bottlenecks. section 1.5

Use throughput reasoning to:

  • Measure actual application data flow or request processing rather than relying only on link capacity. section 1.4
  • Increase throughput by adding concurrency, while recognizing that parallelism can trade higher throughput for worse latency. section 1.5
  • Analyze throughput together with latency using Little’s law and Amdahl’s law. section 2.0

How Latency covers it

How deep it goes
Explains measurement, bandwidth limits, concurrency, pipelining, bottlenecks, and latency trade-offs with a worked example.
Examples
Uses network transfer rates, request processing, and serial versus pipelined laundry processing.
What it assumes
Distinguishes latency from bandwidth and throughput before applying concurrency and parallelism.
What you can do after
Evaluate application performance, compare capacity with delivered work, and reason about concurrency and pipeline bottlenecks.
How it connects
Connects throughput to latency, bandwidth, concurrency, pipelining, parallelism, Little’s law, and Amdahl’s law.

Also explained in

Compare how 20 books explain throughput →

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.