arrow
返回

Exploiting Stragglers in Distributed Computing Systems With Task Grouping

delete2024-11-01
delete0
PRE
AI
T
Tharindu Adikari *
H
Haider Al-Lawati
J
Jason Lam
胡振华 (Zhenhua Hu)
S
Stark C. Draper
DOI:10.1109/TSC.2024.3495513delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
We consider the problem of stragglers in distributed computing systems. Stragglers, which are compute nodes that unpredictably slow down, often increase the completion times of tasks. One common approach to mitigating stragglers is work replication, where only the first completion among replicated tasks is accepted, discarding the others. However, discarding work leads to resource wastage. In this article, we propose a method for exploiting the work completed by stragglers rather than discarding it. The idea is to increase the granularity of the assigned work, and to increase the frequency of worker updates. We show that the proposed method reduces the completion time of tasks via experiments performed on a simulated cluster as well as on Amazon EC2 with Apache Hadoop.
Keyword:
Clustering algorithms
Standards
Prevention and mitigation
Optimization
Hardware
Stochastic processes
Online services
Encyclopedias
Approximation algorithms
Proposals
Distributed systems
stragglers
task scheduling

期刊

IEEE Transactions on Services Computing 封面图
IEEE Transactions on Services Computing
IF:
5.8
论文数:
2.1K
被引数:
6.5K

机构

U
university of toronto
学者数:
14.7W
论文数: 12.0W
被引数: 165