Seq1F1B: Efficient Sequence-Level Pipeline Parallelism for Large Language Model Training
Not on the map. Why?
Abstract (arXiv)
The emergence of large language models (LLMs) relies heavily on distributed training strategies, among which pipeline parallelism plays a crucial role. As LLMs' training sequence length extends to 32k or even 128k, the current pipeline parallel methods face severe bottlenecks, including high memory footprints and substantial pipeline bubbles, greatly hindering model scalability and training throughput. To enhance memory efficiency and training throughput, in this work, we introduce an efficient sequence-level one-forward-one-backward (1F1B) pipeline scheduling method tailored for training LLMs on long sequences named Seq1F1B. Seq1F1B decomposes batch-level schedulable units into finer sequence-level units, reducing bubble size and memory footprint. Considering that Seq1F1B may produce slight extra bubbles if sequences are split evenly, we design a computation-wise strategy to partition input sequences and mitigate this side effect. Compared to competitive pipeline baseline methods such as Megatron 1F1B pipeline parallelism, our method achieves higher training throughput with less memory footprint. Notably, Seq1F1B efficiently trains a LLM with 30B parameters on sequences up to 64k using 64 NVIDIA A100 GPUs without recomputation strategies, a feat unachievable with existing methods. Our source code is based on Megatron-LM, and now is avaiable at: https://github.com/MayDomine/Seq1F1B.git.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 5 Jun 2024.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 7; 2026: 4.
11 papers.
- 2025PipeOffload: Improving Scalability of Pipeline Parallelism with Memory Optimizationcited by 5
- 2025SlimPipe: Memory-Thrifty and Efficient Pipeline Parallelism for Long-Context LLM Trainingcited by 5
- 2025NoLoCo: No-all-reduce Low Communication Training Method for Large Modelscited by 4
- 2025APB: Accelerating Distributed Long-Context Inference by Passing Compressed Context Blocks across GPUscited by 3
- 2025How Social is It? A Benchmark for LLMs' Capabilities in Multi-user Multi-turn Social Agent Taskscited by 3
- 2025TokenSmith: Streamlining Data Editing, Search, and Inspection for Large-Scale Language Model Training and Interpretabilitycited by 0
- 2025Concertina: Data-Centric Adaptive Pipeline Parallelism for Efficient Heterogeneous Long-Context LLM Trainingcited by 0
- 2026A Readiness-Driven Runtime for Pipeline-Parallel Training under Runtime Variabilitycited by 0
- 2026Breaking the Bubble: Asynchronous Pipeline Parallel Training with Bounded Weight Inconsistencycited by 0
- 2026Communication-Efficient Verifiable Attention for LLM Inferencecited by 0
- 2026KV-Pipe: On the Relation Between KV Sharing and Pipeline Parallel Efficiency in LLMscited by 0
- 2026KV-Pipe: On the Relation Between KV Sharing and Pipeline Parallel Efficiency in LLMs16 Aug 2026
- 2026Communication-Efficient Verifiable Attention for LLM Inference15 Jun 2026
- 2026Breaking the Bubble: Asynchronous Pipeline Parallel Training with Bounded Weight Inconsistency5 Jun 2026
- 2026A Readiness-Driven Runtime for Pipeline-Parallel Training under Runtime Variability18 May 2026
- 2025Concertina: Data-Centric Adaptive Pipeline Parallelism for Efficient Heterogeneous Long-Context LLM Training25 Sep 2025
- 2025TokenSmith: Streamlining Data Editing, Search, and Inspection for Large-Scale Language Model Training and Interpretability25 Jul 2025
- 2025NoLoCo: No-all-reduce Low Communication Training Method for Large Models12 Jun 2025
- 2025SlimPipe: Memory-Thrifty and Efficient Pipeline Parallelism for Long-Context LLM Training20 Apr 2025
- 2025How Social is It? A Benchmark for LLMs' Capabilities in Multi-user Multi-turn Social Agent Tasks4 Apr 2025
- 2025PipeOffload: Improving Scalability of Pipeline Parallelism with Memory Optimization3 Mar 2025
- 2025APB: Accelerating Distributed Long-Context Inference by Passing Compressed Context Blocks across GPUs17 Feb 2025