.png){kind=icon}
返回
Optimal Server Selection for Straggler Mitigation
.png){kind=icon}
OA
AI
DOI：10.1109/TNET.2020.2973224.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The performance of large-scale distributed compute systems is adversely impacted by stragglers when the execution time of a job is uncertain. To manage stragglers, we consider a multi-fork approach for job scheduling, where additional parallel servers are added at forking instants. In terms of the forking instants and the number of additional servers, we compute the job completion time and the cost of server utilization when the task processing times are assumed to have a shifted exponential distribution. We use this study to provide insights into the scheduling design of the forking instants and the associated number of additional servers to be started. Numerical results demonstrate orders of magnitude improvement in cost in the regime of low completion times as compared to the prior works.
Keyword:
Servers
Task analysis
Job shop scheduling
Redundancy
Processor scheduling
IEEE transactions
Straggler mitigation
distributed computing
shifted exponential distribution
completion time
scheduling
forking points
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.6
论文数:
4.4K
被引数:
9.5K
机构
引用论文
A harvesting-rate oriented self-adaptive algorithm in Energy-Harvesting Wireless Body Area Networks
.png){kind=icon}
PREAI
分享收藏
分享收藏
查看更多内容