Pangu Ultra MoE: How to Train Your Big MoE on Ascend NPUs (2505.04519v1)
Abstract: Sparse LLMs with Mixture of Experts (MoE) and close to a trillion parameters are dominating the realm of most capable LLMs. However, the massive model scale poses significant challenges for the underlying software and hardware systems. In this paper, we aim to uncover a recipe to harness such scale on Ascend NPUs. The key goals are better usage of the computing resources under the dynamic sparse model structures and materializing the expected performance gain on the actual hardware. To select model configurations suitable for Ascend NPUs without repeatedly running the expensive experiments, we leverage simulation to compare the trade-off of various model hyperparameters. This study led to Pangu Ultra MoE, a sparse LLM with 718 billion parameters, and we conducted experiments on the model to verify the simulation results. On the system side, we dig into Expert Parallelism to optimize the communication between NPU devices to reduce the synchronization overhead. We also optimize the memory efficiency within the devices to further reduce the parameter and activation management overhead. In the end, we achieve an MFU of 30.0% when training Pangu Ultra MoE, with performance comparable to that of DeepSeek R1, on 6K Ascend NPUs, and demonstrate that the Ascend system is capable of harnessing all the training stages of the state-of-the-art LLMs. Extensive experiments indicate that our recipe can lead to efficient training of large-scale sparse LLMs with MoE. We also study the behaviors of such models for future reference.
- Yehui Tang (63 papers)
- Yichun Yin (27 papers)
- Yaoyuan Wang (18 papers)
- Hang Zhou (166 papers)
- Yu Pan (154 papers)
- Wei Guo (221 papers)
- Ziyang Zhang (69 papers)
- Miao Rang (3 papers)
- Fangcheng Liu (7 papers)
- Naifu Zhang (8 papers)
- Binghan Li (5 papers)
- Yonghan Dong (5 papers)
- Xiaojun Meng (23 papers)
- Yasheng Wang (91 papers)
- Dong Li (429 papers)
- Yin Li (150 papers)
- Dandan Tu (25 papers)
- Can Chen (64 papers)
- Youliang Yan (31 papers)
- Fisher Yu (104 papers)