.png){kind=icon}
Return
Straggler Mitigation With Tiered Gradient Codes
.png){kind=icon}
OA
AI
DOI：10.1109/TCOMM.2020.2992721.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Coding theoretic techniques have been proposed for synchronous Gradient Descent (GD) on multiple servers to mitigate stragglers. These techniques provide the flexibility that the job is complete when any k out of n servers finish their assigned tasks. The task size on each server is found based on the values of k and n. However, it is assumed that all the n jobs are started when the job is requested. In contrast, we assume a tiered system, where we start with n(1) >= k tasks, and on completion of c tasks, we start n(2) - n(1) more tasks. The aim is that as long as k servers can execute their tasks, the job gets completed. This paper exploits the flexibility that not all servers are started at the request time to obtain the achievable task sizes on each server. The task sizes are in general lower than starting all n(2) tasks at the request times thus helping achieve lower task sizes which helps to reduce both the job completion time and the total server utilization.
Keywords:
Tiered gradient codes
distributed computing
gradient descent
stragglers
server utilization
completion time
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
ShareSave
View more