English

Long-Context Attention Benchmark: From Kernel Efficiency to Distributed Context Parallelism

Machine Learning 2025-10-22 v1 Artificial Intelligence

Abstract

Transformer-based large language models (LLMs) have achieved remarkable success, yet their standard attention mechanism incurs quadratic computation and memory costs with respect to sequence length, posing a major bottleneck for long-context training. Prior work tackles this challenge along two directions: (1) kernel-level optimizations, which accelerate dense and sparse attention operators; and (2) module-level strategies, often referred to as distributed attention or context parallel training, which scale attention across multiple devices. However, systematic evaluation still remains limited: operator-level comparisons are often incomplete, while context parallel strategies are typically framework-specific, with unclear performance analysis across contexts. To address these gaps, we propose a unified benchmark that integrates representative attention kernels and context parallel mechanisms with a modular and extensible interface for evaluation. The benchmark evaluates methods along two critical dimensions: (1) attention mask patterns, which strongly affect efficiency, scalability, and usability, and (2) sequence length and distributed scale, which determine performance under extreme long-context training. Through comprehensive experiments on the cluster of up to 96 GPUs, our benchmark enables reproducible comparisons, highlights method-specific trade-offs, and provides practical guidance for designing and deploying attention mechanisms in long-context LLM training.

Keywords

Cite

@article{arxiv.2510.17896,
  title  = {Long-Context Attention Benchmark: From Kernel Efficiency to Distributed Context Parallelism},
  author = {Tao Bu and Qiangang Wang and Bowen Zeng and Hanwen Sun and Yunpeng Huang and Chun Cao and Jingwei Xu},
  journal= {arXiv preprint arXiv:2510.17896},
  year   = {2025}
}

Comments

56 pages