Performance Debugging & Benchmarking practice test
p99 TTFT regressions with flat utilisation, OOMs under continuous batching, numerical divergence after an engine upgrade, nondeterministic outputs, slow replicas, and benchmark methodology that does not lie about warm-up, clocks or prompt mix. The pool for this topic holds 10 easy, 12 medium and 8 hard items. Each answer comes with its reasoning and a link to the question or concept page it was drawn from.
Sample items with answers
An early per-request token can invalidate that prefix block and every chained descendant. In the synthetic case with 2,560 shared and 440 unique tokens, a 95% shared-token reuse rate gives 440 + 0.05 x 2,560 = 568 computed tokens/request; zero reuse gives 3,000, a 5.282x work ratio. Compare tokenized prompts and cache identity, then matched per-replica counter deltas. The work ratio does not predict a p99 multiplier, and unchanged utilization does not establish unchanged useful work.
Inter-token latency is the time of one engine step, so decompose the step. For Llama 3.1 8B in BF16 at batch 64 and 4K context on an H100 SXM the bandwidth floor is about 15.1 ms; a step that also carries a 2,048-token prefill chunk takes about 79 ms. A bimodal ITL histogram with its p50 near the floor points to prefill interference; a uniformly slow step points to host overhead or a bigger batch. TTFT being fine already clears the prefill path and the prefix cache.
After the test
Picking an option is easier than deriving the answer at a whiteboard. These pages make you derive it: