论文标题
深度学习工作负载的异质性意识群集计划政策
Heterogeneity-Aware Cluster Scheduling Policies for Deep Learning Workloads
论文作者
论文摘要
GPU,TPU,FPGA和Custom ASIC等专业加速器已越来越多地部署来培训深度学习模型。这些加速器在模型架构之间表现出异质性能行为。现有用于仲裁许多用户这些昂贵培训资源的加速器群的调度程序已经显示了如何优化各种多名,多用户目标,例如Fairness和Makepan。不幸的是,现有调度程序在很大程度上不考虑性能异质性。在本文中,我们提出了一种系统地概括了广泛的现有调度策略的异质性 - 感知的调度程序木槌。木瓜将这些政策表示为优化问题,使以异质性 - 感知方式的目标优化变得容易,同时也认识到诸如空间共享之类的性能优化。然后,盖尔维尔(Gavel)使用基于圆形的调度机制来确保在目标调度策略的情况下,确保作业获得理想的分配。木槌的异质性 - 感知政策允许一个异质群体维持更高的输入负载,并提高最终目标,例如平均工作完成时间,而与异质性 - 非统计学策略相比,最高可使PAN量最高为3.5倍。
Specialized accelerators such as GPUs, TPUs, FPGAs, and custom ASICs have been increasingly deployed to train deep learning models. These accelerators exhibit heterogeneous performance behavior across model architectures. Existing schedulers for clusters of accelerators, which are used to arbitrate these expensive training resources across many users, have shown how to optimize for various multi-job, multi-user objectives, like fairness and makespan. Unfortunately, existing schedulers largely do not consider performance heterogeneity. In this paper, we propose Gavel, a heterogeneity-aware scheduler that systematically generalizes a wide range of existing scheduling policies. Gavel expresses these policies as optimization problems, making it easy to optimize for objectives in a heterogeneity-aware way, while also being cognizant of performance optimizations like space sharing. Gavel then uses a round-based scheduling mechanism to ensure jobs receive their ideal allocation given the target scheduling policy. Gavel's heterogeneity-aware policies allow a heterogeneous cluster to sustain higher input load, and improve end objectives such as average job completion time and makespan by up to 3.5x compared to heterogeneity-agnostic policies.