specific method · filed under optimization
Dynamic Context Parallelism for Large Multimodal Samples
A context-parallel method that partitions large images along the patch dimension and gathers key-value pairs across context-parallel ranks.
Also called Dynamic CP in multimodal encoder.
- 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 extend context parallelism to such large samples. A single large image is partitioned along the patch dimension across multiple devices, and attention is computed by gathering key–value pairs (gather-KV) across CP ranks.
usedsoftware implementationin 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 ParallelismFully Balanced Expert-Parallel TrainingGPU Planning Kernel for Redundant Expert MigrationHybrid 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