Large-scale expert parallelism (EP) has become the standard deployment configuration for Mixture-of-Experts (MoE) models in production. Meanwhile, the highly dynamic nature of LLM workloads requires providers to continuously adjust serving capacity to match fluctuating demand. Scaling MoE serving cannot be efficiently achieved by simply adding or removing serving instances; instead, it often requires resizing the EP group within an existing instance, which we refer to as intra-instance scaling.Existing inference engines primarily rely on instance-level scaling, which destroys and reconstructs entire serving instances, incurring substantial scaling overhead. We present FastEEP (Fast Elastic Expert Parallel), a fast intra-instance scaling system for MoE serving based on the principle of Partial Reuse. FastEEP reuses existing runtime state across worker execution, GPU memory, and communication by separating reusable execution structures from the resources activated by the current EP configuration. This separation enables coordinated resource reclamation and reconfiguration while preserving costly-to-reconstruct state, allowing fast EP scaling without full instance teardown and reconstruction. Our evaluation shows that FastEEP achieves 4.5x--11.7x faster scaling than the existing vLLM-based approach across different models, enabling efficient, fine-grained scaling of MoE serving.
Figures & tables
Figure 1. Fine-grained EP scaling. (a) A wide-EP instance occupies tens of GPUs, so instance-level scaling moves resources in units far coarser than demand changes. (b) A new model need not evict the MoE instance: the instance can give up some GPUs and keep serving. (c) ElasticMoE ( Singh et al., 2025 ) pre-starts one instance per EP configuration but cannot change the EP degree of a running instance.
Figure 2. Bringing one DeepSeek-V2-Lite rank online ( DP=8 , EP=8 ). (a) Runtime state reaches 6.32 GiB before weights are accounted for. (b) The rank reaches steady state after 126 s in six phases, of which only weight load moves model data. (c) The resulting 10.90 GiB of runtime state exceeds the 9.62 GiB of model weights on the rank.
State
Cost
EP-dep.
Today
Reused
Worker process, executor, kernels
24 s startup
no
destroyed
retained
Communication domains, RDMA buffers
13 s setup
members only
rebuilt
subdomain derived
CUDA context
0.32 GiB
no
destroyed
retained
CUDA Graphs
36 s, 1.47 GiB
no
recaptured
replayed
Weights, KV cache, workspaces
9.62 / 71.04 GiB
sizes only
reloaded
pages refilled
Expert placement, request routing
–
yes
rebuilt
rewritten in place
Table 1. What a resize takes apart, itemized by state. Costs are the phases measured in Figure 2 ; footprints are steady-state values on the same rank. Only the last row is a function of the active EP degree.
Figure 3. Architecture of FastEEP. A maximum-size instance retains worker execution contexts, a parent communication domain, and virtual address ranges. Resizing changes the active worker set and physical-memory residency without reconstructing the instance.
Figure 4. Reusing communication state across a resize. A persistent parent domain retains the global rank space and bootstrap context. Scaling from four to two workers changes the NCCL subgroup and NIXL reachability mask. These views, the expert mapping, and request routing are committed together.
Figure 5. Address-stable memory management. A shadow worker retains virtual address ranges while selected physical pages are released. On wake-up, new pages are mapped at the same addresses and restored according to allocation semantics.
Figure 6. Contracting DP and EP execution during scale-down. The scheduler stops routing new requests to target workers and drains or migrates their current requests. Missing experts are copied into available slots on the remaining workers before the target ranks leave the EP data path.
Figure 7. Serving performance (Qwen3-30B-A3B) across EP sizes for prefill-heavy, balanced, and decode-heavy requests (rows): output throughput, mean TTFT, and mean TPOT (columns). Nine panels plot throughput and latency against EP size for three request shapes. Four curves in each panel represent concurrency 4, 16, 64, and 256.
Figure 8. KV-cache capacity for H20 GPUs, nixl_ep , and 128 redundant experts. Each model occupies one row: the left panel shows the per-GPU memory budget across EP widths, and the right panel shows realizable cluster-wide concurrency for 106 -token requests.
Figure 9. End-to-end EP scaling latency across six MoE models. vLLM Elastic EP implementation could not scale DeepSeek-V4-Flash or Mistral-Small-4 ( NaN ). FullAsync refers to a mode in which the execution transition is synchronized with request processing.
Figure 10. Cumulative time across EP scaling phases for vLLM Elastic EP (a, b) and FastEEP (c, d), in the 8→4 and 4→8 directions.
Figure 11. Resource-sharing trace for two colocated services: 5 s rolling mean in panel (a), raw 1 s samples in panels (b)–(d). Each service uses GPUs released by the other’s scale-down.
Figure 12. Throughput during an 8→4→8 scaling cycle under load (5 s rolling mean). Red bands mark zero-output intervals, whose durations measure service interruption.
Figure 13. Boot, teardown, and serving performance of FastEEP and unmodified vLLM at EP 4 and EP 8.
Large Language Models (LLMs) increasingly adopt Mixture-of-Experts (MoE) architectures to scale efficiently under stringent resource constraints. However, MoE's sparse activation causes severe expert load imbalance, where a few experts become stragglers while others remain underutilized, leading to inflated inference latency and cost. Existing solutions assume static, serverful model deployments, limiting expert elasticity and often incurring costly expert swapping or degraded output quality. We present MoEless, an efficient serverless MoE serving framework that mitigates expert load imbalance via elastic expert execution. MoEless leverages lightweight, layer-aware predictors to estimate incoming expert load distributions and proactively identify stragglers. We design optimized scaling and placement strategies to improve function locality, GPU utilization, and cross-expert load balance. MoEless is prototyped on top of Megatron-LM and deployed on an eight-GPU testbed. Experiments with open-source MoE models and real-world workloads show that MoEless reduces inference latency by 43% and inference cost by 84% compared to state-of-the-art solutions.
The Mixture of Experts (MoE) architecture has become a fundamental building block in state-of-the-art large language models (LLMs), improving domain-specific expertise in LLMs and scaling model capacity without proportionally increasing their computational overhead. However, MoE inference often suffers from suboptimal GPU utilization, load imbalance, and elevated latency arising from multiple tokens waiting on the same experts for their computation which arises from sparsity of expert activation. To address these challenges, we propose a dynamic expert replication strategy that predicts which experts are likely to be overloaded and replicates them for upcoming batches of tokens. The replicated experts process batch tokens concurrently across layers, which leads to improved parallelism, shorter GPU idle time, and significantly faster inference. Experimental evaluations conducted on large-scale MoE models, including Switch-base-128 and Switch-base-256, demonstrate that our method achieves near-complete GPU utilization (approx 100%), leading to upto 3x improvement in inference speed while preserving approximately 90-95% of the performance of baseline architectures
Ankit Jyothish, Ali Jannesari, Aishwarya Sarkar +1
Mixture-of-Experts (MoE) has emerged as a promising paradigm for efficiently scaling large language models without a proportional increase in computational cost. However, the standard training strategy of Top-K router prevents MoE models from realizing their full potential for elastic inference. When the number of activated experts is altered at inference time, these models exhibit precipitous performance degradation. In this work, we introduce Matryoshka MoE (M-MoE), a training framework that instills a coarse-to-fine structure directly into the expert ensemble. By systematically varying the number of activated experts during training, M-MoE compels the model to learn a meaningful ranking: top-ranked experts collaborate to provide essential, coarse-grained capabilities, while subsequent experts add progressively finer-grained detail. We explore this principle at multiple granularities, identifying a layer-wise randomization strategy as the most effective. Our experiments demonstrate that a single M-MoE model achieves remarkable elasticity, with its performance at various expert counts closely matching that of an entire suite of specialist models, but at only a fraction of the total training cost. This flexibility not only unlocks elastic inference but also enables optimizing performance by allocating different computational budgets to different model layers. Our work paves the way for more practical and adaptable deployments of large-scale MoE models.
Yaoxiang Wang, Qingguo Hu, Yucheng Ding +6
Xiamen University · Shanghai Jiao Tong University · University of Science and Technology of China +1