This paper characterizes the serving behavior of masked diffusion language models (dLLMs) under concurrent load, using LLaDA-8B with a D2F adapter on an NVIDIA H200. It highlights that dLLM serving cannot simply replicate autoregressive assumptions. The study reveals that request difficulty manifests as discrete denoising steps rather than a continuous variable, challenging existing infrastructure designs.
- dLLMs denoise tokens in parallel, offering potential speedups over autoregressive models.
- Request difficulty is discrete (step count), not continuous, affecting scheduling.
- Existing AR serving infrastructure assumptions do not hold for dLLMs.
- Evaluation used LLaDA-8B with D2F LoRA on a single H200 GPU.
- Real-world load characterization is critical for designing dLLM serving systems.