Accelerating Heterogeneous Tensor Parallelism via Flexible Workload Control

IF 8.1 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
IEEE Transactions on Big Data Pub Date : 2026-06-01 Epub Date: 2026-01-23 DOI:10.1109/TBDATA.2026.3657302
Zhigang Wang;Xu Zhang;Ning Wang;Chuanfei Xu;Yu Gu;Hui Lu;Dawei Zhao;Zhihong Tian
{"title":"Accelerating Heterogeneous Tensor Parallelism via Flexible Workload Control","authors":"Zhigang Wang;Xu Zhang;Ning Wang;Chuanfei Xu;Yu Gu;Hui Lu;Dawei Zhao;Zhihong Tian","doi":"10.1109/TBDATA.2026.3657302","DOIUrl":null,"url":null,"abstract":"Transformer-based foundation models are becoming deeper and larger. For fast training, their billions of parameters (tensors) are split onto parallel tasks running on many modern yet expensive accelerators. To amortize the huge hardware investments, it is cost-effective to share the aggregated resources among multi-tenants. However, resource contention yields the heavy straggling problem. Existing works feature contributions for the traditional data parallelism. They cannot work well for the new tensor parallelism, due to the dependency among split tensors. This paper is the first attempt on accelerating heterogeneous tensor parallelism. We summarize specific challenges, including the very frequent synchronizations and the heavy tensor computation workloads. Our solution is to resize dimensions of parameters on demand, to quickly and dynamically balance workloads. The accuracy loss is reduced through priority resizing. We also migrate workloads between tasks, without any loss of accuracy. The most efficient communication primitives are selected and then scheduled in a non-redundant manner, to reduce the runtime latency. Our final hybrid solution is built on top of resizing and migration. By studying the tradeoff between accuracy and efficiency, it can smartly hit the “sweet spot”. Extensive experiments validate the effectiveness of our proposals.","PeriodicalId":13106,"journal":{"name":"IEEE Transactions on Big Data","volume":"12 3","pages":"994-1005"},"PeriodicalIF":8.1000,"publicationDate":"2026-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Big Data","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11362926/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/1/23 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Transformer-based foundation models are becoming deeper and larger. For fast training, their billions of parameters (tensors) are split onto parallel tasks running on many modern yet expensive accelerators. To amortize the huge hardware investments, it is cost-effective to share the aggregated resources among multi-tenants. However, resource contention yields the heavy straggling problem. Existing works feature contributions for the traditional data parallelism. They cannot work well for the new tensor parallelism, due to the dependency among split tensors. This paper is the first attempt on accelerating heterogeneous tensor parallelism. We summarize specific challenges, including the very frequent synchronizations and the heavy tensor computation workloads. Our solution is to resize dimensions of parameters on demand, to quickly and dynamically balance workloads. The accuracy loss is reduced through priority resizing. We also migrate workloads between tasks, without any loss of accuracy. The most efficient communication primitives are selected and then scheduled in a non-redundant manner, to reduce the runtime latency. Our final hybrid solution is built on top of resizing and migration. By studying the tradeoff between accuracy and efficiency, it can smartly hit the “sweet spot”. Extensive experiments validate the effectiveness of our proposals.
通过灵活的工作量控制加速异构张量并行
基于变压器的基础模型正变得越来越深、越来越大。为了快速训练,它们的数十亿个参数(张量)被分割成并行任务,在许多现代但昂贵的加速器上运行。为了分摊巨大的硬件投资,在多租户之间共享聚合的资源是经济有效的。然而,资源争用会产生严重的掉队问题。现有的工作为传统的数据并行性做出了贡献。由于分裂张量之间的依赖性,它们不能很好地适用于新的张量并行性。本文是加速异构张量并行化的首次尝试。我们总结了具体的挑战,包括非常频繁的同步和繁重的张量计算工作负载。我们的解决方案是根据需要调整参数的大小,以快速动态地平衡工作负载。通过调整优先级大小可以减少精度损失。我们还在任务之间迁移工作负载,而不会损失任何准确性。选择最有效的通信原语,然后以非冗余的方式调度,以减少运行时延迟。我们最终的混合解决方案建立在调整大小和迁移的基础之上。通过研究准确度和效率之间的权衡,它可以巧妙地达到“最佳点”。大量的实验证实了我们建议的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
11.80
自引率
2.80%
发文量
114
期刊介绍: The IEEE Transactions on Big Data publishes peer-reviewed articles focusing on big data. These articles present innovative research ideas and application results across disciplines, including novel theories, algorithms, and applications. Research areas cover a wide range, such as big data analytics, visualization, curation, management, semantics, infrastructure, standards, performance analysis, intelligence extraction, scientific discovery, security, privacy, and legal issues specific to big data. The journal also prioritizes applications of big data in fields generating massive datasets.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书