Tag
This paper introduces MAPL, a method for learned orthogonal compression of activations in pipeline parallelism, reducing communication overhead while maintaining performance via Stiefel manifold constraints and per-stage factorized anchor embeddings.
This paper proposes Speculative Pipeline Decoding (SPD), a framework that uses pipeline parallelism within a single LLM to enable parallel token speculation, avoiding the latency bubbles and accuracy degradation of multi-token prediction in traditional speculative decoding.
SpaceX is finalizing a custom AI training stack written in C, utilizing pipeline parallelism and 220k GB300 GPUs to achieve over an order of magnitude speed improvement, with plans to develop an inference stack for reinforcement learning.
A learner shares enthusiasm for Stanford CS336 lecture 7 on GPU parallelism, which covers fundamental operations and connects them to multi-GPU setups and parallelism techniques like tensor, data, and pipeline parallelism.
This article benchmarks vLLM, SGLang, and llama.cpp on a mixed Blackwell/Ada GPU cluster for long context prefill, finding vLLM significantly outperforms others on heterogeneous setups while SGLang crashes with Ada cards due to FP4 support limitations.
ResBM introduces a transformer-based architecture with residual encoder-decoder bottlenecks for pipeline-parallel training, achieving 128× activation compression while maintaining convergence. The work advances decentralized, internet-grade distributed training by reducing inter-stage communication overhead.