.png){kind=icon}
.png){kind=icon}
Return
Deadline-Aware Coded Computation Across Homogeneous Workers
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2023.3299531.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Distributed computing systems have been widely used in recent years to handle massive computations required by newly emerged machine learning algorithms and signal processing problems. In practice, a distributed computing system often receives multiple tasks each needs to be finished by a specific deadline. This necessitates use of a task scheduler which orders and prioritizes tasks executions. In this work, we consider task scheduling for a homogeneous distributed computing system with multiple matrix-vector multiplication jobs, and try to maximize the number of tasks completed before their deadlines. The main challenges in such a system are random task arrivals and random execution times due to the straggling effect. To address these challenges, we propose two task scheduling algorithms namely simple greedy and farsighted greedy and compare their performance with the ultimate upper bound, i.e., a genie-aided algorithm that knows the exact arrival and execution times of all tasks. Our simulation results demonstrate that the proposed algorithms can approach the performance of the genie-aided algorithm.
Keywords:
Coded distributed computing
task scheduling
random task arrival
task allocation
coding rate
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W