当前位置: X-MOL 学术IEEE ACM Trans. Netw. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Optimal Server Selection for Straggler Mitigation
IEEE/ACM Transactions on Networking ( IF 3.0 ) Pub Date : 2020-02-28 , DOI: 10.1109/tnet.2020.2973224
Ajay Badita , Parimal Parag , Vaneet Aggarwal

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.

中文翻译:

选择最佳服务器以缓解流浪汉

当作业的执行时间不确定时,散乱的人会对大型分布式计算系统的性能产生不利影响。为了管理散乱者,我们考虑了一种用于作业调度的多叉方法,其中在叉的瞬间添加了额外的并行服务器。根据分叉时刻和其他服务器的数量,我们在假设任务处理时间具有指数分布偏移的情况下,计算作业完成时间和服务器使用成本。我们使用这项研究来深入了解分叉时刻的调度设计以及要启动的其他服务器的相关数量。数值结果表明,与以前的工作相比,在较低的完成时间范围内,成本降低了几个数量级。
更新日期:2020-04-22
down
wechat
bug