利用 CREW 实现高效的跨云部分还原

IF 5.6 2区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS IEEE Transactions on Parallel and Distributed Systems Pub Date : 2024-09-13 DOI:10.1109/TPDS.2024.3460185
Shouxi Luo;Renyi Wang;Ke Li;Huanlai Xing
{"title":"利用 CREW 实现高效的跨云部分还原","authors":"Shouxi Luo;Renyi Wang;Ke Li;Huanlai Xing","doi":"10.1109/TPDS.2024.3460185","DOIUrl":null,"url":null,"abstract":"By allowing \n<inline-formula><tex-math>$p$</tex-math></inline-formula>\n out of \n<inline-formula><tex-math>$n$</tex-math></inline-formula>\n workers to conduct \n<i>all reduce</i>\n operations among them for a round of synchronization, \n<i>partial reduce</i>\n, a promising partially-asynchronous variant of \n<i>all reduce</i>\n, has shown its power in alleviating the impacts of stragglers for iterative distributed machine learning (DML). Current \n<i>partial reduce</i>\n solutions are mainly designed for intra-cluster DML, in which workers are networked with high-bandwidth LAN links. Yet no prior work has looked into the problem of how to achieve efficient \n<i>partial reduce</i>\n for cross-cloud DML, where inter-worker connections are with scarcely-available capacities. To fill the gap, in this paper, we propose \n<small>CREW</small>\n, a flexible and efficient implementation of \n<i>partial reduce</i>\n for cross-cloud DML. At the high level, \n<small>CREW</small>\n is built upon the novel design of employing all active workers along with their internal connection capacities to execute the involved communication and computation tasks; and at the low level, \n<small>CREW</small>\n employs a suite of algorithms to distribute the tasks among workers in a load-balanced way, and deal with possible outages of workers/connections, and bandwidth contention. Detailed performance studies confirm that, \n<small>CREW</small>\n not only shortens the execution of each \n<i>partial reduce</i>\n operation, outperforming existing communication schemes such as PS, Ring, \n<small>TopoAdopt</small>\n, and BLINK greatly, but also significantly accelerates the training of large models, up to \n<inline-formula><tex-math>$15\\times$</tex-math></inline-formula>\n and \n<inline-formula><tex-math>$9\\times$</tex-math></inline-formula>\n, respectively, when compared with the all-to-all direct communication scheme and \n<i>original partial reduce</i>\n design.","PeriodicalId":13257,"journal":{"name":"IEEE Transactions on Parallel and Distributed Systems","volume":null,"pages":null},"PeriodicalIF":5.6000,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Efficient Cross-Cloud Partial Reduce With CREW\",\"authors\":\"Shouxi Luo;Renyi Wang;Ke Li;Huanlai Xing\",\"doi\":\"10.1109/TPDS.2024.3460185\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"By allowing \\n<inline-formula><tex-math>$p$</tex-math></inline-formula>\\n out of \\n<inline-formula><tex-math>$n$</tex-math></inline-formula>\\n workers to conduct \\n<i>all reduce</i>\\n operations among them for a round of synchronization, \\n<i>partial reduce</i>\\n, a promising partially-asynchronous variant of \\n<i>all reduce</i>\\n, has shown its power in alleviating the impacts of stragglers for iterative distributed machine learning (DML). Current \\n<i>partial reduce</i>\\n solutions are mainly designed for intra-cluster DML, in which workers are networked with high-bandwidth LAN links. Yet no prior work has looked into the problem of how to achieve efficient \\n<i>partial reduce</i>\\n for cross-cloud DML, where inter-worker connections are with scarcely-available capacities. To fill the gap, in this paper, we propose \\n<small>CREW</small>\\n, a flexible and efficient implementation of \\n<i>partial reduce</i>\\n for cross-cloud DML. At the high level, \\n<small>CREW</small>\\n is built upon the novel design of employing all active workers along with their internal connection capacities to execute the involved communication and computation tasks; and at the low level, \\n<small>CREW</small>\\n employs a suite of algorithms to distribute the tasks among workers in a load-balanced way, and deal with possible outages of workers/connections, and bandwidth contention. Detailed performance studies confirm that, \\n<small>CREW</small>\\n not only shortens the execution of each \\n<i>partial reduce</i>\\n operation, outperforming existing communication schemes such as PS, Ring, \\n<small>TopoAdopt</small>\\n, and BLINK greatly, but also significantly accelerates the training of large models, up to \\n<inline-formula><tex-math>$15\\\\times$</tex-math></inline-formula>\\n and \\n<inline-formula><tex-math>$9\\\\times$</tex-math></inline-formula>\\n, respectively, when compared with the all-to-all direct communication scheme and \\n<i>original partial reduce</i>\\n design.\",\"PeriodicalId\":13257,\"journal\":{\"name\":\"IEEE Transactions on Parallel and Distributed Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":5.6000,\"publicationDate\":\"2024-09-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Parallel and Distributed Systems\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10679930/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Parallel and Distributed Systems","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10679930/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

部分还原是全部还原的一种很有前途的部分异步变体,它允许 n 个工作者中的 $p$ 在一轮同步中在他们之间进行所有还原操作,在减轻迭代式分布式机器学习(DML)中滞后者的影响方面显示出了它的威力。目前的部分还原解决方案主要是针对集群内的 DML 而设计的,在集群内,工作人员通过高带宽局域网链接联网。然而,对于如何在跨云 DML 中实现高效的部分还原这一问题,此前还没有任何研究成果,因为在跨云 DML 中,工人之间的连接几乎没有可用的容量。为了填补这一空白,我们在本文中提出了 CREW,一种灵活高效的跨云 DML 部分还原实现方法。在高层,CREW 采用了新颖的设计,即利用所有活跃的工作者及其内部连接能力来执行相关的通信和计算任务;在底层,CREW 采用了一套算法,以负载均衡的方式在工作者之间分配任务,并处理工作者/连接可能出现的中断和带宽争用问题。详细的性能研究证实,与全对全直接通信方案和原始的部分还原设计相比,CREW 不仅缩短了每个部分还原操作的执行时间,大大优于现有的通信方案,如 PS、Ring、TopoAdopt 和 BLINK,而且还显著加快了大型模型的训练速度,分别达到 $15/times$ 和 $9/times$。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Efficient Cross-Cloud Partial Reduce With CREW
By allowing $p$ out of $n$ workers to conduct all reduce operations among them for a round of synchronization, partial reduce , a promising partially-asynchronous variant of all reduce , has shown its power in alleviating the impacts of stragglers for iterative distributed machine learning (DML). Current partial reduce solutions are mainly designed for intra-cluster DML, in which workers are networked with high-bandwidth LAN links. Yet no prior work has looked into the problem of how to achieve efficient partial reduce for cross-cloud DML, where inter-worker connections are with scarcely-available capacities. To fill the gap, in this paper, we propose CREW , a flexible and efficient implementation of partial reduce for cross-cloud DML. At the high level, CREW is built upon the novel design of employing all active workers along with their internal connection capacities to execute the involved communication and computation tasks; and at the low level, CREW employs a suite of algorithms to distribute the tasks among workers in a load-balanced way, and deal with possible outages of workers/connections, and bandwidth contention. Detailed performance studies confirm that, CREW not only shortens the execution of each partial reduce operation, outperforming existing communication schemes such as PS, Ring, TopoAdopt , and BLINK greatly, but also significantly accelerates the training of large models, up to $15\times$ and $9\times$ , respectively, when compared with the all-to-all direct communication scheme and original partial reduce design.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems 工程技术-工程:电子与电气
CiteScore
11.00
自引率
9.40%
发文量
281
审稿时长
5.6 months
期刊介绍: IEEE Transactions on Parallel and Distributed Systems (TPDS) is published monthly. It publishes a range of papers, comments on previously published papers, and survey articles that deal with the parallel and distributed systems research areas of current importance to our readers. Particular areas of interest include, but are not limited to: a) Parallel and distributed algorithms, focusing on topics such as: models of computation; numerical, combinatorial, and data-intensive parallel algorithms, scalability of algorithms and data structures for parallel and distributed systems, communication and synchronization protocols, network algorithms, scheduling, and load balancing. b) Applications of parallel and distributed computing, including computational and data-enabled science and engineering, big data applications, parallel crowd sourcing, large-scale social network analysis, management of big data, cloud and grid computing, scientific and biomedical applications, mobile computing, and cyber-physical systems. c) Parallel and distributed architectures, including architectures for instruction-level and thread-level parallelism; design, analysis, implementation, fault resilience and performance measurements of multiple-processor systems; multicore processors, heterogeneous many-core systems; petascale and exascale systems designs; novel big data architectures; special purpose architectures, including graphics processors, signal processors, network processors, media accelerators, and other special purpose processors and accelerators; impact of technology on architecture; network and interconnect architectures; parallel I/O and storage systems; architecture of the memory hierarchy; power-efficient and green computing architectures; dependable architectures; and performance modeling and evaluation. d) Parallel and distributed software, including parallel and multicore programming languages and compilers, runtime systems, operating systems, Internet computing and web services, resource management including green computing, middleware for grids, clouds, and data centers, libraries, performance modeling and evaluation, parallel programming paradigms, and programming environments and tools.
期刊最新文献
DyLaClass: Dynamic Labeling Based Classification for Optimal Sparse Matrix Format Selection in Accelerating SpMV Design and Performance Evaluation of Linearly Extensible Cube-Triangle Network for Multicore Systems PeakFS: An Ultra-High Performance Parallel File System via Computing-Network-Storage Co-Optimization for HPC Applications Mitosis: A Scalable Sharding System Featuring Multiple Dynamic Relay Chains Breaking the Memory Wall for Heterogeneous Federated Learning via Model Splitting
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1