CORTEXA
← Browse
arxivcs.LGcs.DC2026-06-29

HSAP: A Hierarchical Sequence-aware Parallelism for Hybrid-Context Generative Models

Songxin Zhang, Zejian Xie, Zhuoyang Song, Cong lin, Junyu Lu, Jiaxing Zhang, Bingyi Jing

In this paper, we aim to combine the advantages of existing sequence parallelism paradigms and overcomes their drawbacks, the most serious of which is the incapability to correctly compute causal attention on the hybrid-context packed sequences, in a stronger sequence parallelism framework. The practical technique of packing sequences for efficiently pretraining and fine-tuning large language models causes cross-contamination problem in attention computation, which can be effectively solved when no parallelism in the sequence length dimension is taken. However, in sequence parallelism, existing approaches either ignore the scenario of hybrid-context sequences or conversely sacrifice and limit parallelism degree for supporting the scenario. To this end, we innovatively propose an efficient Sequence-Aware Parallelism algorithm to conquer the obstacles of intensive tensor transmission and partial attention computation across multiple device groups. Our algorithm utilizes JIT (Just-In-Time) compilation to optimize the communication strategy of all device groups in NCCL level. Further, we integrate existing sequence parallelism paradigms into a Hierarchical Sequence-Aware Parallelism framework which benefits from our sequence-aware algorithm. We additionally elaborate on the memory and communication overhead management of the hierarchical framework to optimize its performance. Through multiple experiments, we demonstrate that our proposed approach outperform other state-of-the-arts sequence parallelism approches in multiple metrics.

View free PDFSource page

Related papers

arxivcs.LGcs.DCq-bio.QM2026-07-03

Design-CP: Context Parallelism for Design of Protein Nanoparticles

Lorenzo Tarricone, Helen E. Eisenach, Aiko Muraishi, Charlotte M. Deane

Many all-atom generative protein models can in principle design large multimeric complexes by jointly modelling all chains, but their quadratic token- and atom-pair representations quickly exceed single-GPU memory as the number of chains and residues modelled grows. We introduce…

View free PDFSource page
arxivcs.LGcs.DCcs.DSmath.NA2026-07-01

Accelerating Discrete Diffusion Models with Parallel-In-Time Sampling

Yu Yao, Huanjian Zhou, Andi Han, Wei Huang, Masashi Sugiyama

Discrete diffusion models are widely used for learning and generating discrete distributions. As the generation process is inherently sequential, the acceleration of sampling is of significant importance. In this work, we parallelize the mainstream $τ$-leaping algorithm for absor…

View free PDFSource page
arxivcs.DCcs.LG2026-07-20

AutoEncoder-Compressed Parallel Split Learning for Pre-trained Model Fine-Tuning

Bas Meuwissen, Vasileios Tsouvalas, Nirvana Meratnia

Distributed Fine-Tuning (DFT) of large-scale Foundation Models (FMs) on resource-constrained edge devices is limited by local compute constraints and communication overhead. Parallel Split Learning (PSL) reduces client-side computation by keeping few model layers on each client a…

View free PDFSource page
arxivcs.LGcs.DC2026-07-14

Agora: Collective and Permissionless Internet-Scale Pretraining of Large Language Models

Gil Avraham, Violetta Shevchenko, Hadi Mohaghegh Dolatabadi, Karol Pajak, James Snewin, Harry Xi, et al.

Training large language models at the multi-billion to trillion parameter scale is confined to datacenters, where data-parallel (DP) and model-parallel (MP) techniques presume homogeneous accelerators, high-speed interconnects, and a single orchestrating entity. Frontier model de…

View free PDFSource page
arxivcs.LGcs.AIcs.DCcs.PF2026-07-16

An Auto-Scaling Approach for Serverless Environments Based on a Multi-Expert Consensus Mechanism

Mobina Kashaniyan, Mehrdad Ashtiani, Amirhossein Ghassemi

Serverless computing provides automatic resource management and pay-per-use execution, but effective autoscaling remains challenging because of dynamic workloads, cold-start latency, and dependencies among functions. We present a dependency-aware autoscaling framework that integr…

View free PDFSource page
arxivcs.DCcs.LG2026-07-02

Lynx: Progressive Speculative Quantization for accelerating KV Transfer in Long-Context Inference

Wenchen Han, Gingfung Matthew Yeung, Marco Barletta, William Toner, Amory Hoste, Adam Barker

Long-context inference is increasingly common in large language model (LLM) serving, driven by retrieval-augmented generation and agentic systems. In disaggregated inference, these workloads require transferring large Key-Value (KV) caches across the network, where decoding canno…

View free PDFSource page