Skip to content
nonconvexcard

Single-stream decode latency floors

NumericalIntermediate⏱ 30 minLLM Opslatencybandwidthlower boundquantization

Problem

Using tstep≥Nb/βt_{\text{step}} \ge Nb/\beta with β=3.35\beta = 3.35 TB/s per GPU:

  1. Compute the floor and the implied maximum tokens/second for a 7B model at BF16, INT8 and 4-bit.
  2. Do the same for a 70B model at BF16 across 2 GPUs (assume bandwidth adds and ignore the interconnect).
  3. A product requires 30 tokens/s per user. Which of these configurations can meet it, ignoring all other overheads?

Compute the requested quantities and say what they mean. A number without an interpretation is not an answer.

Solution

Opening this before you have a real attempt on paper is the fastest way to feel like you understand something you cannot reproduce.

Related problems

All problems
SolvedProblemFieldTypeDifficultyTime
Count the FLOPs of a forward passLLM OpsNumericalFoundation15 min
Derive the attention crossover lengthLLM OpsProofBeginner15 min
Ridge point and the batch size needed to saturateLLM OpsNumericalBeginner15 min
Implement kernel ridge regression runClassical MLCodingIntermediate1 hour
Price a latency targetAI SystemsNumericalIntermediate30 min