TIAS: Two-level Information-Agnostic Job Scheduling in GPU Clusters

Kun Yang, Jieyu Lin, Wei Ni, Lianghua Song
{"title":"TIAS: Two-level Information-Agnostic Job Scheduling in GPU Clusters","authors":"Kun Yang, Jieyu Lin, Wei Ni, Lianghua Song","doi":"10.1109/INSAI54028.2021.00041","DOIUrl":null,"url":null,"abstract":"In recent years, deep learning algorithms have shown a trend towards larger models and larger datasets. Centralized training is unable keep up with the training requirements due to limited storage and computing resources, thus distributed learning is becoming an important area of research for improving learning efficiency. There are many studies on using the features of deep learning workload to design a central scheduler for production clusters.While existing work has been focusing on overall completion time and resource efficiency, little attention has been paid to the execution deadlines. To achieve a balance between the goals of deadline and non-deadline jobs, we design a Two-level Information-Agnostic Scheduling strategy(TIAS), which can schedule the two kinds of jobs together without knowing jobs’ training duration. In the first level, we use different priority calculation methods for the two kinds of jobs; in the second level, we design a new indicator \"queue urgency\" based on three observations to sort deadline jobs within the same queue. Experiments on a trace-driven simulator prove that TIAS can achieve the best trade-off between deadline miss rate and non-deadline jobs’ average job completion time(JCT) compared to existing solutions.","PeriodicalId":232335,"journal":{"name":"2021 International Conference on Networking Systems of AI (INSAI)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Networking Systems of AI (INSAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INSAI54028.2021.00041","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In recent years, deep learning algorithms have shown a trend towards larger models and larger datasets. Centralized training is unable keep up with the training requirements due to limited storage and computing resources, thus distributed learning is becoming an important area of research for improving learning efficiency. There are many studies on using the features of deep learning workload to design a central scheduler for production clusters.While existing work has been focusing on overall completion time and resource efficiency, little attention has been paid to the execution deadlines. To achieve a balance between the goals of deadline and non-deadline jobs, we design a Two-level Information-Agnostic Scheduling strategy(TIAS), which can schedule the two kinds of jobs together without knowing jobs’ training duration. In the first level, we use different priority calculation methods for the two kinds of jobs; in the second level, we design a new indicator "queue urgency" based on three observations to sort deadline jobs within the same queue. Experiments on a trace-driven simulator prove that TIAS can achieve the best trade-off between deadline miss rate and non-deadline jobs’ average job completion time(JCT) compared to existing solutions.
GPU集群中的两级信息不可知作业调度
近年来,深度学习算法呈现出更大模型和更大数据集的趋势。由于存储和计算资源的限制,集中式训练无法满足训练需求,因此分布式学习成为提高学习效率的重要研究领域。利用深度学习工作负载的特性来设计生产集群的中央调度程序已经有很多研究。虽然现有的工作一直侧重于总体完成时间和资源效率,但很少注意执行期限。为了平衡截止日期和非截止日期作业的目标,我们设计了一种两级信息不可知调度策略(TIAS),该策略可以在不知道作业培训时间的情况下将两类作业同时调度。在第一层,我们对两类作业使用了不同的优先级计算方法;在第二层,我们基于三个观察结果设计了一个新的指标“队列紧迫性”来对同一队列内的截止日期作业进行排序。在跟踪驱动模拟器上的实验证明,与现有方案相比,TIAS能够在截止日期遗漏率和非截止日期作业的平均作业完成时间(JCT)之间实现最佳平衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信