{"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":"35 11","pages":"2224-2238"},"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\":\"35 11\",\"pages\":\"2224-2238\"},\"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}
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 (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.