liveBook · Manning

Percentile

As explained in Latency

A latency percentile is a threshold below which a specified percentage of measured requests have completed.

A latency percentile is the threshold below which a specified percentage of measured requests complete. The 95th-percentile latency contains 95% of requests, while the 99th and 99.9th percentiles expose progressively slower behavior. Percentiles describe a distribution rather than collapsing performance into one average; minimum and maximum show only its extremes. section 2.2 section 2.7

High percentiles are called tail latency. They matter because users encounter slow requests more often than an apparent outlier suggests, and parallel services can become bound by their slowest subrequest. Increasing fanout therefore increases the chance that service latency exceeds a threshold. section 2.2 section 2.7

Measure and inspect percentiles with a distribution-oriented workflow:

  • Collect latency samples while defining what is measured and controlling the measurement environment. section 2.7
  • Plot a histogram to reveal the main cluster and sparse right-hand tail. section 2.6.1
  • Use HdrHistogram to obtain values at selected percentiles such as 25%, 50%, 90%, 99%, 99.9%, and 99.99%. section 2.6.1
  • Compare tail percentiles when evaluating optimizations, because component variability, queuing, physical limits, operating-system configuration, and application design can shape latency. section 2.2 section 2.7

A fanout example

Suppose a service sends requests to multiple servers in parallel and waits for every response. Even when most subrequests finish in about ten milliseconds, an occasional slow subrequest determines the completed service request's latency. The relevant question is therefore not only the typical latency, but how the 95th, 99th, or higher percentile changes as parallel fanout grows. section 2.2

How Latency covers it

How deep it goes
Defines percentile thresholds, explains tail effects in parallel systems, and demonstrates histogram and HdrHistogram measurement, without deriving percentile algorithms.
Examples
Demonstrates parallel server fanout, ping-latency histograms, and percentile plots using selected percentile levels.
What it assumes
Assumes measured latency samples and basic distributions, while explaining percentile interpretation and measurement choices directly.
What you can do after
Evaluate latency with histograms and apply HdrHistogram to extract and plot selected percentile values.
How it connects
Connects percentiles with latency distributions, tail latency, queuing, parallel execution, fanout, Little’s law, and Amdahl’s law.

Also explained in

Compare how 7 books explain percentile →

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.