Size a serving cluster and find the binding constraint
NumericalIntermediate⏱ 1 hourAI Systemssizingkv cacheutilisationbottleneck
Problem
A replica has 80 GB of device memory. The model weights occupy 28 GB in bf16 and workspace takes a further 6 GB. Paged allocation achieves of the remainder. A typical request holds MB of KV cache and takes s end to end. Offered load is requests per second and the target utilisation is .
- Compute and the replicas required.
- The hardware has a compute-to-bandwidth ratio of 280 FLOP/byte and the weights are 2 bytes per parameter. Estimate the batch at which decode stops being weight-bound, and say whether this replica is memory-bound or compute-bound.
- KV quantisation to int8 halves . Recompute the replica count and say what changes about the answer to part 2.
- Instead of quantising, someone proposes raising to 0.85. Using with the same bare service time, say what actually happens.
Compute the requested quantities and say what they mean. A number without an interpretation is not an answer.
Hints
Hints — 0 of 2 revealed
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| Solved | Problem | Field | Type | Difficulty | Time |
|---|---|---|---|---|---|
| Implement the cluster sizing formula run | AI Systems | Coding | 30 min | ||
| KV cache sizing with MHA and GQA | LLM Ops | Numerical | 30 min | ||
| Derive the M/M/1 queue from detailed balance | AI Systems | Proof | 1 hour | ||
| Price a latency target | AI Systems | Numerical | 30 min | ||
| Simulate M/M/1 and verify the utilisation wall run | AI Systems | Coding | 1 hour |