implementation detail · filed under optimization
GPU Planning Kernel for Redundant Expert Migration
A GPU planning implementation for redundant expert migration that provides near-optimal plans while respecting an expert-to-rank upper bound.
Also called online planning of redundant experts.
- source
- 1
- model
- 1
- lab adopt it
- 1
- strongest
- used
How sources treat it
One count per evidence span, weakest treatment to strongest.
used 1
Documented in
Evidence
1 span quoted from the sources, strongest treatment first.
We therefore compute exact solutions offline with integer linear programming (ILP) for representative cases as references and design a GPU planning kernel that is near-optimal, incurs negligible overhead, and always respects the E/R upper bound.
usedunclearin Kimi K3Moonshot AI
Filed alongside
Other methods under optimization :: training parallelism.
Expert ParallelismTensor ParallelismMoonEPCommunication-Computation OverlapPipeline ParallelismAll-to-all Gradient Exchange with Local FP32 SummationCache-Based Pipeline CommunicationContext ParallelismData Replica Reduction over the Data Center NetworkData-Weighted Data ParallelismDynamic Context Parallelism for Large Multimodal SamplesFully Balanced Expert-Parallel TrainingHybrid ZeRO Bucket Assignment for MuonKDA Context ParallelismKnapsack-Based Balanced Assignment of Dense Parameter MatricesLoad-Balanced Image ShardingModified DualPipe 1F1B Pipeline Overlap for mHCNS-FLOP-Balanced Static Parameter PartitioningPipeline Payload ExtensionsPipeline ZeRO-2 Gradient Sharding with CPU Offloadingpipeline-bubble scheduling of ViT computationRedundant-Expert Capacity ReservationSConv-Aware Tensor-Parallel ShardingSequence Parallelism for Activations