Deadline-Aware Flow Scheduling for AI Clusters with Heterogeneous Latency Requirements

Modern training clusters use a distributed approach to train deep learning jobs. In each communication round phase, distributed machine learning jobs generate multiple parallel data flows, which comprise a coflow group. In this literature, coflow scheduling has been widely studied and one common objective is to minimize the average job completion time. However, some jobs might have strict deadline, minimizing the deadline violation ratio is another important objective. We observe that competition among different jobs is a critical factor preventing jobs from meeting their deadlines. In this paper, we propose Allot, an online scheduler that combines admission control and flow scheduling. Allot accounts for inter-job competition when scheduling coflows, thereby minimizing the deadline violation ratio. Simulation results have demonstrated that Allot outperforms the benchmark solutions by more than 1.4× in meeting deadlines.

Authors

Institutions

Publication Details

Published
2024-10-15
DOI
https://doi.org/10.1109/fnwf63303.2024.11028829
Citations
1
Primary Topic
Cloud Computing and Resource Management
Type
article
Field-Weighted Citation Impact
0.78

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Deadline-Aware Flow Scheduling for AI Clusters with Heterogeneous Latency Requirements

Qiaojun Hu, Yongli Zhao, Jie Zhang, Yibo Wang et al.
1 citations
Cloud Computing and Resource Management
0.78
article

Deadline-Aware Flow Scheduling for AI Clusters with Heterogeneous Latency Requirements

Qiaojun Hu, Yongli Zhao, Jie Zhang, Yibo Wang, Wei Wang, Yajie Li, Yiyang Li
article en
1 citations

Abstract

Modern training clusters use a distributed approach to train deep learning jobs. In each communication round phase, distributed machine learning jobs generate multiple parallel data flows, which comprise a coflow group. In this literature, coflow scheduling has been widely studied and one common objective is to minimize the average job completion time. However, some jobs might have strict deadline, minimizing the deadline violation ratio is another important objective. We observe that competition among different jobs is a critical factor preventing jobs from meeting their deadlines. In this paper, we propose Allot, an online scheduler that combines admission control and flow scheduling. Allot accounts for inter-job competition when scheduling coflows, thereby minimizing the deadline violation ratio. Simulation results have demonstrated that Allot outperforms the benchmark solutions by more than 1.4× in meeting deadlines.

Beijing University of Posts and Telecommunications (CN)
National Key Research and Development Program of China
Openalex Percentile: Top 16%
Cloud Computing and Resource Management
0.78
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Deadline-Aware Flow Scheduling for AI Clusters with Heterogeneous Latency Requirements — Qiaojun Hu, Yongli Zhao, et al. · (2024) | TGRS Research Map | TGRS