specific method · filed under inference & serving
GPU planning kernel for online expert placement
A GPU kernel for near-optimal online expert-placement planning that respects the E/R upper bound.
Also called GPU planning kernel.
- source
- 1
- model
- 1
- lab adopt it
- 1
- strongest
- core
How sources treat it
One count per evidence span, weakest treatment to strongest.
core 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.
coresoftware implementationin Kimi K3Moonshot AI
Filed alongside
Other methods under inference & serving :: inference kernel.
Batch-invariant deterministic kernelsCUDA GraphCUDA Graph capture size reductionFlashAttention 3Kernel fusionMoE-side chunkingSynchronization-free static-shape MoE executionTensorRT-LLM multi-head attention backendAvoiding split-KDeepGEMM-based batch-invariant matrix multiplicationDistributed shared memory for cross-SM attention data exchangeDual-kernel batch-invariant attention decodingDynamic load balancingExp-free TopK kernelExpert-optimized Triton kernelsFA4 sheared-bias attention kernelFlashAttentionFlashAttention 4FlashKDAFP8 GEMMFused AttnRes merge and RMSNorm kernelFused latent down-projection and MoE-router GEMMFused mHC kernelsFused QSA kernel