The pause before the first word and the pace after it have different causes.
For many language-model services, the prompt is processed first; then the model generates output tokens one step at a time. Serving research often tracks time to first token (TTFT) for the initial phase and time per output token (TPOT) for the generation phase. These answer different questions: how long until a response starts, and how quickly it continues.
The model can reuse cached attention keys and values from earlier tokens instead of recomputing the entire history each time. This key-value (KV) cache helps with repeated decoding, but it occupies memory and grows with the context and generated sequence. Long prompts and long responses can therefore change the compute and memory required by a request. Read the KV cache guide for a memory estimate and serving strategies ↗; for a compact model’s complete device footprint, see how to evaluate memory for small language models ↗.
Some serving systems also use speculative decoding to propose several next tokens and verify them together. See how draft-and-verify generation works and what to measure ↗.
First-token waitPrompt length, model size, hardware, queueing, and serving design can all affect when generation begins.
Generation paceModel computation, output length, concurrent requests, and decoding settings shape how quickly tokens arrive.
Working memoryModel weights and request-specific cache compete for finite accelerator memory.
System throughputBatching can serve multiple requests together, but the serving system must manage their different prompt and output lengths.
The DistServe study ↗ analyzes prefill and decoding as phases with different latency requirements. The PagedAttention paper ↗ examines how KV-cache memory management affects batching and throughput. These papers describe serving experiments, not a guarantee about any particular provider’s infrastructure.