Exploiting Stragglers in Distributed Computing Systems with Task Grouping
Abstract
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 paper, 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.
Cite
@article{arxiv.2411.03645,
title = {Exploiting Stragglers in Distributed Computing Systems with Task Grouping},
author = {Tharindu Adikari and Haider Al-Lawati and Jason Lam and Zhenhua Hu and Stark C. Draper},
journal= {arXiv preprint arXiv:2411.03645},
year = {2024}
}
Comments
This paper has been accepted for publication in IEEE Transactions on Services Computing. The initial results presented in this paper appeared in the proceedings of the Allerton Conference on Communication, Control, and Computing in 2023