计算机科学
仲裁人
调度(生产过程)
GPU群集
分布式计算
并行计算
库达
运营管理
经济
作者
Kshiteej Mahajan,Arjun Balasubramanian,Arjun Singhvi,Shivaram Venkataraman,Aditya Akella,Amar Phanishayee,Shuchi Chawla
标识
DOI:10.48550/arxiv.1907.01484
摘要
Modern distributed machine learning (ML) training workloads benefit significantly from leveraging GPUs. However, significant contention ensues when multiple such workloads are run atop a shared cluster of GPUs. A key question is how to fairly apportion GPUs across workloads. We find that established cluster scheduling disciplines are a poor fit because of ML workloads' unique attributes: ML jobs have long-running tasks that need to be gang-scheduled, and their performance is sensitive to tasks' relative placement. We propose Themis, a new scheduling framework for ML training workloads. It's GPU allocation policy enforces that ML workloads complete in a finish-time fair manner, a new notion we introduce. To capture placement sensitivity and ensure efficiency, Themis uses a two-level scheduling architecture where ML workloads bid on available resources that are offered in an auction run by a central arbiter. Our auction design allocates GPUs to winning bids by trading off efficiency for fairness in the short term but ensuring finish-time fairness in the long term. Our evaluation on a production trace shows that Themis can improve fairness by more than 2.25X and is ~5% to 250% more cluster efficient in comparison to state-of-the-art schedulers.
科研通智能强力驱动
Strongly Powered by AbleSci AI