Pre-gated MoE: An Algorithm-System Co-Design for Fast and Scalable Mixture-of-Expert Inference
Large language models (LLMs) based on transformers have made significant strides in recent years, the success of which is driven by scaling up their model size. Despite their high algorithmic performance, the computational and memory requirements of LLMs present unprecedented challenges. To tackle the high compute requirements of LLMs, the Mixture-of-Experts (MoE) architecture was introduced which is able to scale its model size without proportionally scaling up its computational requirements. Unfortunately, MoE's high memory demands and dynamic activation of sparse experts restrict its applicability to real-world problems. Previous solutions that offload MoE's memory-hungry expert parameters to CPU memory fall short because the latency to migrate activated experts from CPU to GPU incurs high performance overhead. Our proposed Pre-gated MoE system effectively tackles the compute and memory challenges of conventional MoE architectures using our algorithm-system co-design. Pre-gated MoE employs our novel pre-gating function which alleviates the dynamic nature of sparse expert activation, allowing our proposed system to address the large memory footprint of MoEs while also achieving high performance. We demonstrate that Pre-gated MoE is able to improve performance, reduce GPU memory consumption, while also maintaining the same level of model quality. These features allow our Pre-gated MoE system to cost-effectively deploy large-scale LLMs using just a single GPU with high performance.
Code (1)
Tasks
CPUGPUMixture-of-ExpertsSimilar Papers 제목 키워드 기반
Development and Validation of a Scalable Fast Load Shedding Technique for Industrial Power Systems
The work aims to improve the existing fast load shedding algorithm for industrial power system to increase performance, reliability, and scalability for future expansions. The paper illustrates the development of a scala…
Hard-ODT: Hardware-Friendly Online Decision Tree Learning Algorithm and System
Decision trees are machine learning models commonly used in various application scenarios. In the era of big data, traditional decision tree induction algorithms are not suitable for learning large-scale datasets due to …
Lipschitz-Certifiable Training with a Tight Outer Bound
Verifiable training is a promising research direction for training a robust network. However, most verifiable training methods are slow or lack scalability. In this study, we propose a fast and scalable certifiable train…
CuMF_SGD: Fast and Scalable Matrix Factorization
Matrix factorization (MF) has been widely used in e.g., recommender systems, topic modeling and word embedding. Stochastic gradient descent (SGD) is popular in solving MF problems because it can deal with large data sets…
CPUGPUIncremental LearningRecommendation Systems+1Load Mitigation and Power Tracking Control for Multi-Rotor Turbines
A model-based feasible control strategy for multi-rotor systems is presented, pursuing two control objectives simultaneously: Mechanical loads on the main tower are to be mitigated, and an externally determined power cha…