.png){kind=icon}
返回
Straggler Mitigation With Tiered Gradient Codes
.png){kind=icon}
OA
AI
DOI：10.1109/TCOMM.2020.2992721.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Tiered gradient codes
distributed computing
gradient descent
stragglers
server utilization
completion time
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
引用论文
.png){kind=icon}
Sprout: A Functional Caching Approach to Minimize Service Latency in Erasure-Coded StorageSprout: 一种功能缓存方法，可最大程度地减少擦除编码存储中的服务延迟OAAI
OAAI分享收藏
查看更多内容