SearcharxivSearch

arXiv subjects

Ne Wang

Publications and source records attributed to Ne Wang.

2 recordsLinked to original sources

Remoe: Towards Efficient and Low-Cost MoE Inference in Serverless Computing

Mixture-of-Experts (MoE) has become a dominant architecture in large language models (LLMs) due to its ability to scale model capacity via sparse expert activation. Meanwhile, serverless computing, with its elasticity and pay-per-use billing, is well-suited for deploying MoEs with bursty workloads. However, the large number of experts in MoE models incurs high inference costs due to memory-intensive parameter caching. These costs are difficult to mitigate via simple model partitioning due to input-dependent expert activation. To address these issues, we propose Remoe, a heterogeneous MoE inference system tailored for serverless computing. Remoe assigns non-expert modules to GPUs and expert modules to CPUs, and further offloads infrequently activated experts to separate serverless functions to reduce memory overhead and enable parallel execution. We incorporate three key techniques: (1) a Similar Prompts Searching (SPS) algorithm to predict expert activation patterns based on semantic similarity of inputs; (2) a Main Model Pre-allocation (MMP) algorithm to ensure service-level objectives (SLOs) via worst-case memory estimation; and (3) a joint memory and replica optimization framework leveraging Lagrangian duality and the Longest Processing Time (LPT) algorithm. We implement Remoe on Kubernetes and evaluate it across multiple LLM benchmarks. Experimental results show that Remoe reduces inference cost by up to 57% and cold start latency by 47% compared to state-of-the-art baselines.

cs.DC

Online Service Placement and Request Scheduling in MEC Networks

Mobile edge computing (MEC) emerges as a promising solution for servicing delay-sensitive tasks at the edge network. A body of recent literature started to focus on cost-efficient service placement and request scheduling. This work investigates the joint optimization of service placement and request scheduling in a dense MEC network, and develops an efficient online algorithm that achieves close-to-optimal performance. Our online algorithm consists of two basic modules: (1) a regularization with look-ahead approach from competitive online convex optimization, for decomposing the offline relaxed minimization problem into multiple sub-problems, each of which can be efficiently solved in each time slot; (2) a randomized rounding method to transform the fractional solution of offline relaxed problem into integer solution of the original minimization problem, guaranteeing a low competitive ratio. Both theoretical analysis and simulation studies corroborate the efficacy of our proposed online MEC optimization algorithm.

cs.DC