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
- Qiaojun Hu
- Yongli Zhao (ORCID: https://orcid.org/0000-0003-3716-8248)
- Jie Zhang (ORCID: https://orcid.org/0000-0002-6979-7084)
- Yibo Wang (ORCID: https://orcid.org/0000-0001-9984-581X)
- Wei Wang (ORCID: https://orcid.org/0000-0002-0503-2816)
- Yajie Li (ORCID: https://orcid.org/0000-0002-8751-7947)
- Yiyang Li (ORCID: https://orcid.org/0000-0002-5809-6901)
Institutions
- Beijing University of Posts and Telecommunications (CN)
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
- National Key Research and Development Program of China