MoE-Prefill: Zero Redundancy Overheads in MoE Prefill Serving
Zhaoyuan Su, Olatunji Ruwase, Karthik Ganesan, Aurick Qiao, Samyam Rajbhandari, Juncheng Yang, Yue Cheng, Yuxiong He

TL;DR
MoE-Prefill introduces a novel asynchronous expert weight gathering system that significantly improves efficiency and throughput in MoE prefill serving for large language models, reducing redundant computation and synchronization.
Contribution
It proposes MoE-Prefill, a system that decouples expert placement from activation routing, enabling asynchronous expert weight gathering and improved serving performance.
Findings
Achieves 1.35-1.37x throughput over baseline on real workloads.
Up to 1.59x throughput on synthetic long-context workloads.
Sustains 29.8-36.2% per-GPU FLOPs utilization.
Abstract
Production LLM workloads increasingly serve discriminative tasks, such as classification, recommendation, and verification, whose answers are read from the logits of a single prefill pass with no autoregressive decoding. Serving these prefill-only workloads on mixture-of-experts (MoE) models is bottlenecked not by compute but by the distributed execution required to fit the model: existing parallel strategies (tensor, expert, and pipeline parallelism) trade memory pressure for redundant computation, communication, and synchronization, severely degrading MoE prefill serving efficiency. We observe that these overheads stem from coupling expert placement with synchronous activation routing -- a design inherited from the decoding era. The long, compute-bound forward passes of large-batch prefill open a per-layer window wide enough to stream expert weights in the background, replacing…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
