A Bayesian optimization framework with epsilon-greedy search selects expert memory, replicas, and scatter-gather communication mode to reduce serverless MoE inference cost.
Distributed Inference Performance Optimization for LLMs on CPUs
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Large language models (LLMs) hold tremendous potential for addressing numerous real-world challenges, yet they typically demand significant computational resources and memory. Deploying LLMs onto a resource-limited hardware device with restricted memory capacity presents considerable challenges. Distributed computing emerges as a prevalent strategy to mitigate single-node memory constraints and expedite LLM inference performance. To reduce the hardware limitation burden, we proposed an efficient distributed inference optimization solution for LLMs on CPUs. We conduct experiments with the proposed solution on 5th Gen Intel Xeon Scalable Processors, and the result shows the time per output token for the LLM with 72B parameter is 140 ms/token, much faster than the average human reading speed about 200ms per token.
citation-role summary
citation-polarity summary
fields
cs.DC 1years
2025 1verdicts
REJECT 1roles
background 1polarities
support 1representative citing papers
citing papers explorer
-
Optimizing Distributed Deployment of Mixture-of-Experts Model Inference in Serverless Computing
A Bayesian optimization framework with epsilon-greedy search selects expert memory, replicas, and scatter-gather communication mode to reduce serverless MoE inference cost.