arrow
Return

Compressed Coded Distributed Computing

delete2021-05-01
delete5
delete
OA
AI
A
Ahmed Roushdy Elkordy *
李松泽 cover
李松泽 (Songze Li)
M
Mohammad Ali Maddah-Ali
A
A. Salman Avestimehr
DOI:10.1109/TCOMM.2021.3054906delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
Communication overhead is one of the major performance bottlenecks in large-scale distributed computing systems, in particular for machine learning applications. Conventionally, compression techniques are used to reduce the load of communication by combining intermediate results of the same computation task as much as possible. Recently, via the development of coded distributed computing (CDC), it has been shown that it is possible to enable coding opportunities across intermediate results of different computation tasks to further reduce the communication load. We propose a new scheme, named compressed coded distributed computing (in short, compressed CDC), which jointly exploits the above two techniques (i.e., combining the intermediate results of the same computation and coding across the intermediate results of different computations) to significantly reduce the communication load for computations with linear aggregation (reduction) of intermediate results in the final stage that are prevalent in machine learning (e.g., distributed training algorithms where partial gradients are computed distributedly and then averaged in the final stage). In particular, compressed CDC first compresses/combines several intermediate results for a single computation, and then utilizes multiple such combined packets to create a coded multicast packet that is simultaneously useful for multiple computations. We characterize the achievable communication load of compressed CDC and show that it substantially outperforms both combining methods and CDC scheme. Based on the compressed CDC technique, we then study a distributed training problem as one of its application. We characterize the communication load for this distributed training problem and show that it is asymptotically optimal.
Keywords:
Task analysis
Training
Distributed computing
Encoding
Bandwidth
Multicast communication
Machine learning
MapReduce
distributed training
gradient aggregation
coded multicasting
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Transactions on Communications cover
IEEE Transactions on Communications
IF:
8.3
Papers:
1.2W
Citations:
3.6W

Organization

U
university of southern california
Scholars:
4.6W
Papers: 3.8W
Citations: 51
S
Sharif University of Technology
Scholars:
1.1W
Papers: 1.1W
Citations: 9.5K