AutoSP: Unlocking Long-Context LLM Training Via Compiler-Based Sequence Parallelism
Not on the map. Why?
Abstract (arXiv)
Large-language-models (LLMs) demonstrate enormous utility in long-context tasks which require processing prompts that consist of tens to hundreds of thousands of tokens. However, existing LLM training libraries do not provide easy to use abstractions to optimize for long-context training, instead focusing on optimizations for models with large parameter counts through ZeRO-3/FSDP, Tensor and Pipeline parallelism. This forces users to rewrite LLM training libraries to incorporate compositions of various complex long-context optimizations, such as sequence-parallelism, to training pipelines; a process that requires in-depth expertise, reducing developer productivity. To tackle these challenges, we introduce AutoSP: the first automated solution to automatically optimize LLM training for longer-contexts. AutoSP compiles models and applies a targeted set of optimizations: automated sequence parallelism, and long-context aware activation-checkpointing, to drastically enhance LLM trainability at negligible cost to throughput. Our evaluation demonstrates AutoSP's capability on both NVIDIA and AMD hardware, increasing training contexts by upto 2.7× and 2.5× respectively over competitive hand-written baseline at negligible cost to runtime performance.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 16 of its 22 references that are in the map. First posted on arXiv 29 Apr 2026.
Builds on
16 of 22 references.
References · 16
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2019Megatron-LM: Training Multi-Billion Parameter Language Models Using Model Parallelismcited by 1,829
- 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Shardingcited by 1,601
- 2019ZeRO: Memory Optimizations Toward Training Trillion Parameter Modelscited by 1,278
- 2016Training Deep Nets with Sublinear Memory Costcited by 825
- 2023Ring Attention with Blockwise Transformers for Near-Infinite Contextcited by 448
- 2024MT-Bench-101: A Fine-Grained Benchmark for Evaluating Large Language Models in Multi-Turn Dialoguescited by 247
- 2020Scalable Multi-Hop Relational Reasoning for Knowledge-Aware Question Answeringcited by 122
- 2021GSPMD: General and Scalable Parallelization for ML Computation Graphscited by 109
- 2019Checkmate: Breaking the Memory Wall with Optimal Tensor Rematerializationcited by 90
- 2025MDocAgent: A Multi-Modal Multi-Agent Framework for Document Understandingcited by 66
- 2020Dynamic Tensor Rematerializationcited by 45
4 more
- 2024Mirage: A Multi-Level Superoptimizer for Tensor Programscited by 39
- 2025A Simple yet Effective Layout Token in Large Language Models for Document Understandingcited by 9
- 2024SimpleFSDP: Simpler Fully Sharded Data Parallel with torch.compilecited by 7
- 2025DeepCompile: A Compiler-Driven Approach to Optimizing Distributed Deep Learning Trainingcited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026Piper: A Programmable Distributed Training Systemcited by 0
- 2026Piper: A Programmable Distributed Training System9 Jun 2026