Jin Fang

Jin Fang

Auto-generated profile, based on publicly available information

Jin Fang

School of Computer Science and Technology, University of Science and Technology of China, Hefei, Anhui, China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 February 2023 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
JFJin Fang
Jin Fang
GZGongming Zhao
Gongming Zhao
HXHongli Xu
Hongli Xu
CWChangbo Wu
Changbo Wu
ZYZhuolong Yu
Zhuolong Yu
As the scale of distributed training increases, it brings huge communication overhead in clusters. Some works try to reduce the communication cost through gradient compression or communication scheduling. However, these methods either downgrade the training accuracy or do not reduce the total transmission amount. One promising approach, called in-network aggregation, is proposed to mitigate the bandwidth bottleneck in clusters by aggregating gradients in programmable hardware (e.g., Intel Tofino switches). However, existing solutions mainly implement in-network aggregation through fixed (or default) routing paths, resulting in load imbalancing and long communication time. To deal with this issue, we propose GRID, the first-of-its-kind work on G radient R outing with I n-network Aggregation for D istributed Training. In the control plane, we present an efficient gradient routing algorithm based on randomized rounding and formally analyze the approximation performance. In the data plane, we realize in-network aggregation by carefully designing the logic of workers and programmable switches. We implement GRID and evaluate its performance on a small-scale testbed consisting of 3 Intel Tofino switches and 9 commodity servers. With a combination of testbed experiments and large-scale simulations, we show that GRID can reduce the communication time by $38.4\%$ – $60.1\%$ and speed up distributed training by $17.4\%$ – $52.7\%$ compared with state-of-the-art solutions.

13 May 2024
Verified
Conference Paper
Open access
JLJiawei Liu
Jiawei Liu
YZYutong Zhai
Yutong Zhai
GZGongming Zhao
Gongming Zhao
HXHongli Xu
Hongli Xu
JFJin Fang
Jin Fang
YZYing Zhu
Ying Zhu
Deep learning has brought about a revolutionary transformation in network applications, particularly in domains like e-commerce and online advertising. Distributed training (DT), as a critical means to expedite model training, has progressively emerged as a key foundational infrastructure for such applications. However, with the rapid advancement of hardware accelerators, the performance bottleneck in DT has shifted from computation to communication. In-network aggregation (INA) solutions have shown promise in alleviating the communication bottleneck. Regrettably, current INA solutions primarily focus on improving efficiency under the traditional parameter server (PS) architecture and do not fully address the communication bottleneck caused by limited PS ingress bandwidth. To bridge this gap, we propose InArt, the first work to introduce INA with routing selection in a multi-PS architecture. InArt employs a multi-PS architecture to split DT tasks among multiple PSs, and selects appropriate routing schemes to fully harness INA capabilities. To accommodate traffic dynamics, InArt adopts a two-phase approach: splitting the training model among multiple parameter servers and selecting routing paths for INA. We propose Lagrange multiplier and randomized rounding algorithms for these phases, respectively. We implement InArt and evaluate its performance through experiments on physical platforms (Tofino switches) and Mininet emulation (P4 Software Switches). Experimental results show that InArt can reduce communication time by 48%\!\sim57\!% compared with state-of-the-art solutions.

21 June 2023 in Computer Networks
Verified
Journal Article
Closed access
JFJin Fang
Jin Fang
GZGongming Zhao
Gongming Zhao
HXHongli Xu
Hongli Xu
HTHuaqing Tu
Huaqing Tu
HWHaibo Wang
Haibo Wang

29 April 2024 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
JFJin Fang
Jin Fang
HXHongli Xu
Hongli Xu
GZGongming Zhao
Gongming Zhao
ZYZhuolong Yu
Zhuolong Yu
BSBingchen Shen
Bingchen Shen
LXLiguang Xie
Liguang Xie
The surging scale of distributed training (DT) incurs significant communication overhead in datacenters, while a promising solution is in-network aggregation (INA). It leverages programmable switches (e.g., Intel Tofino switches) for gradient aggregation to accelerate DT tasks. Due to switches’ limited on-chip memory size, existing solutions try to design the memory sharing mechanism for INA. This mechanism requires gradients to arrive at switches synchronously, while network dynamics make it common for the asynchronous arrival of gradients, resulting in existing solutions being inefficient (e.g., massive communication overhead). To address this issue, we propose GOAT, the first-of-its-kind work on gradient scheduling with collaborative in-network aggregation, so that switches can efficiently aggregate asynchronously arriving gradients. Specifically, GOAT first partitions the model into a set of sub-models, then decides which sub-model gradients each switch is responsible for aggregating exclusively and to which switch each worker should send its sub-model gradients. To this end, we design an efficient knapsack-based randomized rounding algorithm and formally analyze the approximation performance. We implement GOAT and evaluate its performance on a testbed consisting of 3 Intel Tofino switches and 9 servers. Experimental results show that GOAT can speed up the DT by $1.5 \times$ compared to the state-of-the-art solutions.

2 December 2025 in IEEE Transactions on Networking
Verified
Journal Article
Closed access
GZGongming Zhao
Gongming Zhao
YDYichen Dong
Yichen Dong
HXHongli Xu
Hongli Xu
JFJin Fang
Jin Fang
ZYZhen Yao
Zhen Yao
CXChu Xu
Chu Xu
Distributed training (DT) has emerged as a solution to address the growing computational resource demands of training large-scale machine learning models. To meet this need, cloud providers typically build GPU clusters to accommodate DT jobs. For DT job requests, cloud providers need to determine in which GPUs place workers (i.e., job placement). Existing approaches usually place workers on as few idle machines as possible to minimize communication time. However, this scheme will lead to a resource fragmentation problem, which degrades the resource utilization rate of the GPU cluster and increases training costs for cloud providers. In this paper, we propose $\textsf {Titan}$ , a novel job placement scheme that mitigates the influence of resource fragmentation by enhancing the utilization of non-idle machines. To further optimize resource allocation, we introduce a dynamic defragmentation algorithm that migrates fragmented jobs to consolidate GPU resources, enabling efficient placement of large-scale training jobs. $\textsf {Titan}$ formulates a multi-objective non-linear optimization problem and proves its NP-hardness. To solve this problem, $\textsf {Titan}$ presents an effective submodular-based greedy algorithm with a tight approximation ratio ( $1-\frac {1}{e}$ ). We evaluate $\textsf {Titan}$ with a large-scale simulation employing real-world job traces and a small-scale testbed consisting of 8 servers with 32 logical GPUs. Experimental results show that $\textsf {Titan}$ can achieve near-optimal training throughput while improving the efficiency of the cluster by 74.9% compared to the state-of-the-art solutions.

1 January 2026 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
HXHongli Xu
Hongli Xu
BWBaoqing Wang
Baoqing Wang
JLJiawei Liu
Jiawei Liu
GZGongming Zhao
Gongming Zhao
JFJin Fang
Jin Fang
CQChunming Qiao
Chunming Qiao