paper-with-me

홈 › Papers

Pollux: Co-adaptive Cluster Scheduling for Goodput-Optimized Deep Learning

2020-08-27 · Aurick Qiao, Sang Keun Choe, Suhas Jayaram Subramanya, Willie Neiswanger, Qirong Ho, Hao Zhang, Gregory R. Ganger, Eric P. Xing

Pollux improves scheduling performance in deep learning (DL) clusters by adaptively co-optimizing inter-dependent factors both at the per-job level and at the cluster-wide level. Most existing schedulers expect users to specify the number of resources for each job, often leading to inefficient resource use. Some recent schedulers choose job resources for users, but do so without awareness of how DL training can be re-optimized to better utilize the provided resources. Pollux simultaneously considers both aspects. By monitoring the status of each job during training, Pollux models how their goodput (a novel metric we introduce that combines system throughput with statistical efficiency) would change by adding or removing resources. Leveraging these information, Pollux dynamically (re-)assigns resources to improve cluster-wide goodput, while respecting fairness and continually optimizing each DL job to better utilize those resources. In experiments with real DL jobs and with trace-driven simulations, Pollux reduces average job completion times by 37-50% relative to state-of-the-art DL schedulers, even when they are provided with ideal resource and training configurations for every job. Pollux promotes fairness among DL jobs competing for resources based on a more meaningful measure of useful job progress, and reveals a new opportunity for reducing DL cost in cloud environments. Pollux is implemented and publicly available as part of an open-source project at https://github.com/petuum/adaptdl.

📄 PDF Abstract BibTeX arXiv:2008.12260

Code (2)

petuum/adaptdl 공식 구현 pytorch
petuum/pollux-results 공식 구현

Tasks

Deep LearningFairnessScheduling

Similar Papers 제목 키워드 기반

FlowPrefill: Decoupling Preemption from Prefill Scheduling Granularity to Mitigate Head-of-Line Blocking in LLM Serving

2026-02-18 · Chia-chi Hsieh, Zan Zong, Xinyang Chen, Jianjiang Li 외 arxiv

The growing demand for large language models (LLMs) requires serving systems to handle many concurrent requests with diverse service level objectives (SLOs). This exacerbates head-of-line (HoL) blocking during the comput…

Computational Efficiency

Learning in Chaos: Efficient Autoscaling and Self-healing for Distributed Training at the Edge

2025-05-19 · Wenjiao Feng, Rongxing Xiao, Zonghang Li, Hongfang Yu 외

Frequent node and link changes in edge AI clusters disrupt distributed training, while traditional checkpoint-based recovery and cloud-centric autoscaling are too slow for scale-out and ill-suited to chaotic and self-gov…

Scheduling

SCORPIO: Serving the Right Requests at the Right Time for Heterogeneous SLOs in LLM Inference

2025-05-29 · Yinghao Tang, Tingfeng Lan, Xiuqi Huang, Hui Lu 외

Existing Large Language Model (LLM) serving systems prioritize maximum throughput. They often neglect Service Level Objectives (SLOs) such as Time to First Token (TTFT) and Time Per Output Token (TPOT), which leads to su…

Language ModelingLanguage ModellingLarge Language ModelManagement+1

Send Pilot or Data? Leveraging Age of Channel State Information for Throughput Maximization

2025-03-18 · Sirin Chakraborty, Yin Sun

In this paper, we study the optimal timing for pilot and data transmissions to maximize effective throughput, also known as goodput, over a wireless fading channel. The receiver utilizes the received pilot signal and its…

Scheduling

Symphony: Optimized DNN Model Serving using Deferred Batch Scheduling

2023-08-14 · Lequn Chen, Weixin Deng, Anirudh Canumalla, Yu Xin 외

Having large batch sizes is one of the most critical aspects of increasing the accelerator efficiency and the performance of DNN model inference. However, existing model serving systems cannot achieve adequate batch size…

GPUScheduling