Skip to content

DynaNDE: Dynamic Near-Data Expert Scheduling for Batched MoE Inference

Aug 2026 · 0 citations · 34 references
Computer Science

TL;DR

DynaNDE is presented, a dynamic near-data expert scheduling framework that exploits NPU-NDP collaboration to accelerate batched MoE inference and introduces an analytical performance model that captures hardware heterogeneity, data-movement costs, and communication-computation overlap in cooperative NPU-NDP execution.

Abstract

Mixture-of-Experts (MoE) models enable efficient scaling of large language model (LLM) inference but suffer from substantial data-movement overhead when deployed on neural processing unit (NPU)-based systems. Near-Data Processing (NDP) provides a promising way to mitigate this bottleneck via cooperative NPU-NDP execution. However, existing NPU-NDP MoE systems do not fully account for hardware heterogeneity, dynamic expert-level concurrency, and temporal expert reuse during batched inference. This paper presents DynaNDE, a dynamic near-data expert scheduling framework that exploits NPU-NDP collaboration to accelerate batched MoE inference. DynaNDE introduces an analytical performance model that captures hardware heterogeneity, data-movement costs, and communication-computation overlap in cooperative NPU-NDP execution. Guided by this model, DynaNDE determines per-layer expert scheduling across the NPU and NDP while accounting for expert-level concurrency. DynaNDE also incorporates a reuse-aware runtime that avoids redundant parameter movement when experts reside in NPU memory. Experimental results show that DynaNDE achieves substantial throughput improvements over the state-of-the-art NPU-NDP MoE serving framework, with average speedups of 2.6$\times$ and 2.2$\times$ for the prefill and decoding stages, respectively.

View source

Similar papers

#natural language process... Preprint Sep 2026

PCoMoE: Shifting MoE Inference from Monolithic Expert Selection to Fine-Grained Path Composition

PCoMoE is presented, a path-compositional execution framework that shifts MoE inference from coarse-grained expert selection to fine-grained path composition and achieves up to a 1.31x end-to-end inference speedup while enhancing model accuracy by 10%.

Zi-Yan Gan, Fang-Xin Liu, Chenyang Guan et al. · 0 citations
Preprint Sep 2026

Weave: Fine-Grained Dynamic SM Scheduling in an MoE Megakernel for Compute-Communication Overlap

Weave is presented, to the authors' knowledge the first MoE overlap system that performs fine-grained dynamic SM scheduling - deciding per layer and per GPU by routing results at runtime, and achieves a 2.89x geometric-mean MoE-layer speedup and a 1.33x geometric-mean end-to-end speedup over five state-of-the-art basel...

Ziyu Huang, Yang-Jie Zhou, Chen-Hao Zhu et al. · 0 citations
Preprint Aug 2026

SAEM: Stage-Aware Expert Management for Memory-Efficient MoE Inference in Chain-of-Thought Reasoning

SAEM is proposed, a stage-aware MoE inference runtime that detects reasoning stage boundaries and exploits stage-level activation coherence to guide expert placement and achieves an average 1.33x throughput improvement over the strongest state-of-the-art caching and offloading baselines under constrained GPU memory.

Yujie Zhang, Bin Gao, Tulika Mitra · 0 citations
#artificial intelligence Preprint Sep 2026

SeqMoE: Toward Full-Load Performance via Predictive and Graph-Compatible MoE Offloading

This work is the first to recast expert activation prediction as sequence modeling, enabling accurate multi-step, multi-layer forecasts that provide a long and reliable window for downstream decisions, and derives general runtime principles encompassing compute-transparent expert placement and synchronization-free orch...

Zi-Han Wang, Yu-Qi Wang, Lei Gong et al. · 0 citations
Review Sep 2026

Herschel: Continuous Optimization of Production LLM Inference through On-Demand Profiling

Model-as-a-service platforms call for continuous optimization as complex serving conditions expose inefficiencies missed before deployment. Detailed always-on profiling can incur substantial overhead, while lightweight collection omits information needed for diagnosis. We present Herschel, a continuous optimization sys...

Lu-Ping Wang, Wei-Gao Chen, Yi-Fei Wu et al. · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.