DSA: Efficient Data-Plane Memory Scheduler for In-Network Aggregation to Accelerate Distributed Training

To reduce the traffic volume and accelerate communication in distributed training (DT) jobs, recent works introduce In-Network Aggregation (INA) to move the gradient summation into network programmable switches. However, switch memory is a scarce resource, unable to support massive DT jobs in data centers, and existing INA solutions have not utilized switch memory to the best extent. We propose DSA, an Efficient Data-Plane switch memory Scheduler for in-network Aggregation. DSA introduces preemption to the switch memory management for INA jobs. Furthermore, under packet preemption scenarios, DSA optimizes the selective retransmission mechanism to reduce redundant retransimtting packets to alleviate congestion. In the data plane, DSA allows gradient tensors with high priority to preempt the switch aggregators (basic computation unit in INA) from tensors with low priority, which avoids an aggregator wasting time in idle. In the control plane, DSA devises a priority policy which assigns high priority to gradient tensors that benefit overall job efficiency more, e.g., communication-intensive jobs. We implement the prototype of DSA. The experimental results show that DSA can improve the average job completion time (JCT) by up to 1.35x compared with baseline solutions.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Networking
Published
2025-09-16
DOI
https://doi.org/10.1109/ton.2025.3607725
Primary Topic
Interconnection Networks and Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

DSA: Efficient Data-Plane Memory Scheduler for In-Network Aggregation to Accelerate Distributed Training

Xiaolin Chen, Jinbin Hu, Jin Wang, Kai Chen et al.
IEEE Transactions on Networking
Interconnection Networks and Systems
article

DSA: Efficient Data-Plane Memory Scheduler for In-Network Aggregation to Accelerate Distributed Training

Xiaolin Chen, Jinbin Hu, Jin Wang, Kai Chen, Hao Wang, Xiaobin Xu
article en

Abstract

To reduce the traffic volume and accelerate communication in distributed training (DT) jobs, recent works introduce In-Network Aggregation (INA) to move the gradient summation into network programmable switches. However, switch memory is a scarce resource, unable to support massive DT jobs in data centers, and existing INA solutions have not utilized switch memory to the best extent. We propose DSA, an Efficient Data-Plane switch memory Scheduler for in-network Aggregation. DSA introduces preemption to the switch memory management for INA jobs. Furthermore, under packet preemption scenarios, DSA optimizes the selective retransmission mechanism to reduce redundant retransimtting packets to alleviate congestion. In the data plane, DSA allows gradient tensors with high priority to preempt the switch aggregators (basic computation unit in INA) from tensors with low priority, which avoids an aggregator wasting time in idle. In the control plane, DSA devises a priority policy which assigns high priority to gradient tensors that benefit overall job efficiency more, e.g., communication-intensive jobs. We implement the prototype of DSA. The experimental results show that DSA can improve the average job completion time (JCT) by up to 1.35x compared with baseline solutions.

IEEE Transactions on NetworkingVol. 34
Hong Kong University of Science and Technology (HK), Qiongtai Teachers College (CN), Sanya University (CN), Changsha University of Science and Technology (CN), University of Hong Kong (HK)
Openalex Percentile: Top 71%
Interconnection Networks and Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.