Coded Distributed Computing Over Multi-Server Clustered Network for Federated Learning

In this paper, we focus on the application of coded distributed computing (CDC) in a multi-server clustered network (MSCN), which is designed to accelerate the gradient update process in federated learning (FL) by considering both communication and computational heterogeneity. As the number of participating devices increases and resource heterogeneity becomes more pronounced, reducing total execution latency (TEL) has become a critical challenge. To address this issue, we focus on optimizing the matching between heterogeneous devices and server task loads to improve resource utilization while enhancing the robustness and fault tolerance of the FL system. To minimize TEL, we propose a greedy algorithm and an iter-genetic algorithm for device assignment, named GADA and IGADA, based on the task allocation for the single server (TASS) algorithm, respectively. Based on simulation results and theoretical analysis, we confirm that our proposed algorithms substantially reduce the TEL in various scenarios compared to existing CDC methods, with complexity markedly lower than that of the exhaustive scheme.

Authors

Institutions

Publication Details

Published
2025-06-17
DOI
https://doi.org/10.1109/vtc2025-spring65109.2025.11174461
Primary Topic
Privacy-Preserving Technologies in Data
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Coded Distributed Computing Over Multi-Server Clustered Network for Federated Learning

Shushi Gu, Zhikai Zhang, Qinyu Zhang, Wei Xiang et al.
Privacy-Preserving Technologies in Data
article

Coded Distributed Computing Over Multi-Server Clustered Network for Federated Learning

Shushi Gu, Zhikai Zhang, Qinyu Zhang, Wei Xiang, G.D. Lei, Wenjing Mou
article en

Abstract

In this paper, we focus on the application of coded distributed computing (CDC) in a multi-server clustered network (MSCN), which is designed to accelerate the gradient update process in federated learning (FL) by considering both communication and computational heterogeneity. As the number of participating devices increases and resource heterogeneity becomes more pronounced, reducing total execution latency (TEL) has become a critical challenge. To address this issue, we focus on optimizing the matching between heterogeneous devices and server task loads to improve resource utilization while enhancing the robustness and fault tolerance of the FL system. To minimize TEL, we propose a greedy algorithm and an iter-genetic algorithm for device assignment, named GADA and IGADA, based on the task allocation for the single server (TASS) algorithm, respectively. Based on simulation results and theoretical analysis, we confirm that our proposed algorithms substantially reduce the TEL in various scenarios compared to existing CDC methods, with complexity markedly lower than that of the exhaustive scheme.

La Trobe University (AU), Harbin Institute of Technology (CN), Peng Cheng Laboratory (CN)
Openalex Percentile: Top 86%
Privacy-Preserving Technologies in Data
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.