Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Xin Jiang 0027

dblp:42/4142-27 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
0009-0005-5164-306XORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 87% Cloud and datacenter computing · 13%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed systems › distributed machine learning › distributed training
communication-efficient distributed training
0.812024
GreedW: A Flexible and Efficient Decentralized Framework for Distributed Machine Learning · IEEE Trans. Computers 2024
Distributed systems
distributed machine learning
0.812024
GreedW: A Flexible and Efficient Decentralized Framework for Distributed Machine Learning · IEEE Trans. Computers 2024
Distributed systems › distributed machine learning
distributed training
0.812024
GreedW: A Flexible and Efficient Decentralized Framework for Distributed Machine Learning · IEEE Trans. Computers 2024
Distributed systems › distributed data processing
straggler mitigation
0.812024
GreedW: A Flexible and Efficient Decentralized Framework for Distributed Machine Learning · IEEE Trans. Computers 2024
Cloud and datacenter computing
cluster resource management and scheduling
0.212024
GreedW: A Flexible and Efficient Decentralized Framework for Distributed Machine Learning · IEEE Trans. Computers 2024
Cloud and datacenter computing
job scheduling
0.212024
GreedW: A Flexible and Efficient Decentralized Framework for Distributed Machine Learning · IEEE Trans. Computers 2024

Methods — techniques the papers use, named apart from their topics

heterogeneity-aware workload allocation · 0.8greedy strategy · 0.8
YearPublicationVenuePosition
2024 GreedW: A Flexible and Efficient Decentralized Framework for Distributed Machine Learning
abstract
With the ever-increasing demand for computing power in deep learning, distributed training techniques have proven to be effective in meeting these demands. However, current existing state-of-the-art distributed training frameworks, such as Parameter Server (PS), Ring-All-Reduce, and their varieties, still face significant challenges. In particular, the existence of communication bottlenecks can severely limit the efficiency and scalability of distributed training frameworks, making it difficult to fully and effectively exert the computing power of large-scale clusters, especially in the presence of dynamic and ever-changing network environments. To address these issues and further maximize the utilization of the computing power of clusters, in this paper we propose an efficient and dynamic distributed training framework, named GreedW. GreedW can greatly improve the training efficiency of workers by dynamically constructing an adaptive customized communication network and adaptively scheduling the workload. Specifically, GreedW employs a greedy strategy to dynamically construct the communication network tree in each iteration for gradient transmission with minimum communication cost and applies a heterogeneity-aware workload allocation scheme to adaptively balance the heavy traffic across heterogeneous workers in the cluster taking into account the available computing capabilities of each node, which effectively alleviates the network bottleneck. It is worth noting that GreedW is enabled to dynamically adjust the assigned job on each worker node based on their completion time during each round of model aggregation to ensure that each worker node completes its assignments around the same time, thus mitigating the intractable straggler issue and minimizing their idle waiting time. Comprehensive experimental evaluations on three different-scaled training models (i.e., Mnist-2NN, Mnist-CNN, and TextCNN) for image recognition and natural language processing tasks demonstrate that GreedW outperforms the existing state-of-the-art frameworks in terms of training efficiency, system flexibility, and robustness.
Ting Wang 0001, Xin Jiang 0027, Qin Li 0002, Haibin Cai
IEEE Trans. Computers2