NanoCP: Request-Level Dynamic Context Parallelism for Data-Expert Parallel Decoding
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914583114940416 |
|---|---|
| author | Chen, Jiefei Lin, Binbin Ma, Jinming Duan, Jiangfei Duanmu, Haojie Liu, Hao Cheng, Qinxiu Li, Xiuhong Pei, Zhilin Wang, Hui Zhang, Xingcheng Lin, Dahua |
| author_facet | Chen, Jiefei Lin, Binbin Ma, Jinming Duan, Jiangfei Duanmu, Haojie Liu, Hao Cheng, Qinxiu Li, Xiuhong Pei, Zhilin Wang, Hui Zhang, Xingcheng Lin, Dahua |
| contents | Modern serving systems for Mixture-of-Experts (MoE) models adopt hybrid data-expert parallelism: expert parallelism (EP) shards experts across GPUs to scale capacity, while data parallelism (DP) replicates attention layers across instances to process independent requests. Existing systems bind each request's attention, MoE communication, and KV cache to a single instance. Because attention latency scales with KV cache size while MoE communication latency scales with batch size, this binding cannot balance both simultaneously, producing EP stragglers; it also fragments KV memory across instances, inflating tail latency under long contexts. While existing context parallelism (CP) mitigates these constraints, its uniform parallelism degree incurs prohibitive communication and attention-side overheads.
We present \work, which decouples MoE communication from KV cache placement and achieves dual balance through dynamic context parallelism (DCP). DCP assigns each request a context-parallel degree sized to its KV footprint: long requests distribute attention across multiple instances; short requests remain local.
This dynamic parallelism effectively liquefies the KV cache across the cluster, balancing both the per-instance KV cache occupancy and batch sizes without unnecessary load-balancing costs. To bridge DCP with static execution, \work introduces an ahead-of-time (AOT) graph engine paired with a custom routing-based communication backend. Experimental results show that \work maintains up to $1.88\times$--$3.27\times$ higher request rates under strict time-per-output-token (TPOT) service level objectives (SLOs). Furthermore, \work significantly mitigates stragglers, reducing P99 tail latency by up to $1.79\times$--$2.12\times$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_21100 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | NanoCP: Request-Level Dynamic Context Parallelism for Data-Expert Parallel Decoding Chen, Jiefei Lin, Binbin Ma, Jinming Duan, Jiangfei Duanmu, Haojie Liu, Hao Cheng, Qinxiu Li, Xiuhong Pei, Zhilin Wang, Hui Zhang, Xingcheng Lin, Dahua Distributed, Parallel, and Cluster Computing Modern serving systems for Mixture-of-Experts (MoE) models adopt hybrid data-expert parallelism: expert parallelism (EP) shards experts across GPUs to scale capacity, while data parallelism (DP) replicates attention layers across instances to process independent requests. Existing systems bind each request's attention, MoE communication, and KV cache to a single instance. Because attention latency scales with KV cache size while MoE communication latency scales with batch size, this binding cannot balance both simultaneously, producing EP stragglers; it also fragments KV memory across instances, inflating tail latency under long contexts. While existing context parallelism (CP) mitigates these constraints, its uniform parallelism degree incurs prohibitive communication and attention-side overheads. We present \work, which decouples MoE communication from KV cache placement and achieves dual balance through dynamic context parallelism (DCP). DCP assigns each request a context-parallel degree sized to its KV footprint: long requests distribute attention across multiple instances; short requests remain local. This dynamic parallelism effectively liquefies the KV cache across the cluster, balancing both the per-instance KV cache occupancy and batch sizes without unnecessary load-balancing costs. To bridge DCP with static execution, \work introduces an ahead-of-time (AOT) graph engine paired with a custom routing-based communication backend. Experimental results show that \work maintains up to $1.88\times$--$3.27\times$ higher request rates under strict time-per-output-token (TPOT) service level objectives (SLOs). Furthermore, \work significantly mitigates stragglers, reducing P99 tail latency by up to $1.79\times$--$2.12\times$. |
| title | NanoCP: Request-Level Dynamic Context Parallelism for Data-Expert Parallel Decoding |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2605.21100 |