Surviving Partial Rank Failures in Wide Expert-Parallel MoE Inference
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , , , , , , , , , , , , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916000955367424 |
|---|---|
| author | Sun, Xun Chen, Shaoyuan Ma, Pingchuan Chen, Yue Yuan, Ziwei Cao, Zhanhao Han, Han Cai, Shangming Ma, Teng Shang, Xuchun Zhao, Xinpeng Yang, Ke Wei, Junlin Lin, Lianzhi Liu, Yuji Ren, Feng Hu, Haoran Wan, Cheng Shan, Yingdi Wu, Yongwei Zhang, Mingxing |
| author_facet | Sun, Xun Chen, Shaoyuan Ma, Pingchuan Chen, Yue Yuan, Ziwei Cao, Zhanhao Han, Han Cai, Shangming Ma, Teng Shang, Xuchun Zhao, Xinpeng Yang, Ke Wei, Junlin Lin, Lianzhi Liu, Yuji Ren, Feng Hu, Haoran Wan, Cheng Shan, Yingdi Wu, Yongwei Zhang, Mingxing |
| contents | Mixture-of-Experts (MoE) serving relies on wide expert parallelism (EP) to aggregate the memory capacity and bandwidth of many GPUs within one inference instance. This efficiency comes with a systems cost: every decoding step depends on token dispatch and combination across all active EP ranks, so even one rank failure can disrupt the entire service. Existing EP stacks handle such failures poorly because they treat membership as a fixed configuration established at initialization. The same rank set determines communicator state, expert placement, and the routing metadata baked into CUDA execution graphs, leaving the system with no way to shrink around a failure while keeping the instance valid.
This paper argues that partial-failure tolerance should instead be formulated as a live EP validity problem. We present EEP, a communication and runtime substrate that represents membership as explicit, mutable runtime state. EEP repairs the specific state invalidated by a fault: it restores peer reachability without rebuilding the communication substrate, repairs lost expert coverage through a bandwidth-aware hierarchy, and reintegrates repaired ranks without forcing healthy ranks to recapture their CUDA graphs.
We implement EEP in an EP serving stack integrated with SGLang and evaluate it under steady-state serving, failure recovery, and rank reintegration. The results show that explicit mutable membership preserves the steady-state fast path, staying within 4.4% of a fixed-membership DeepEP baseline under static serving, while turning a local rank fault from whole-instance downtime into two bounded interruptions. On a single-rank failure workload, EEP incurs an 11s recovery pause and an 8s reintegration pause, and restores throughput to within 95% of the pre-fault level within 52s, whereas a fixed-membership full-restart baseline remains unavailable until 348s. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_10670 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Surviving Partial Rank Failures in Wide Expert-Parallel MoE Inference Sun, Xun Chen, Shaoyuan Ma, Pingchuan Chen, Yue Yuan, Ziwei Cao, Zhanhao Han, Han Cai, Shangming Ma, Teng Shang, Xuchun Zhao, Xinpeng Yang, Ke Wei, Junlin Lin, Lianzhi Liu, Yuji Ren, Feng Hu, Haoran Wan, Cheng Shan, Yingdi Wu, Yongwei Zhang, Mingxing Distributed, Parallel, and Cluster Computing Mixture-of-Experts (MoE) serving relies on wide expert parallelism (EP) to aggregate the memory capacity and bandwidth of many GPUs within one inference instance. This efficiency comes with a systems cost: every decoding step depends on token dispatch and combination across all active EP ranks, so even one rank failure can disrupt the entire service. Existing EP stacks handle such failures poorly because they treat membership as a fixed configuration established at initialization. The same rank set determines communicator state, expert placement, and the routing metadata baked into CUDA execution graphs, leaving the system with no way to shrink around a failure while keeping the instance valid. This paper argues that partial-failure tolerance should instead be formulated as a live EP validity problem. We present EEP, a communication and runtime substrate that represents membership as explicit, mutable runtime state. EEP repairs the specific state invalidated by a fault: it restores peer reachability without rebuilding the communication substrate, repairs lost expert coverage through a bandwidth-aware hierarchy, and reintegrates repaired ranks without forcing healthy ranks to recapture their CUDA graphs. We implement EEP in an EP serving stack integrated with SGLang and evaluate it under steady-state serving, failure recovery, and rank reintegration. The results show that explicit mutable membership preserves the steady-state fast path, staying within 4.4% of a fixed-membership DeepEP baseline under static serving, while turning a local rank fault from whole-instance downtime into two bounded interruptions. On a single-rank failure workload, EEP incurs an 11s recovery pause and an 8s reintegration pause, and restores throughput to within 95% of the pre-fault level within 52s, whereas a fixed-membership full-restart baseline remains unavailable until 348s. |
| title | Surviving Partial Rank Failures in Wide Expert-Parallel MoE Inference |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2605.10670 |