TY - GEN
T1 - Inductive-bias-driven reinforcement learning for efficient schedules in heterogeneous clusters
AU - Banerjee, Subho S.
AU - Jha, Saurabh
AU - Kalbarczyk, Zbigniew T.
AU - Iyer, Ravishankar K.
N1 - Publisher Copyright:
© ICML 2020. All rights reserved.
PY - 2020
Y1 - 2020
N2 - The probheterogeneous processors (e.g., CPUs, GPUs, FPGAs)*scheduling of workloads onto is of fundamental importance in modern data centers. Current system schedulers rely on application/system-specific heuristics that have to be built on a case-by-case basis. Recent work has demonstrated ML techniques for automating the heuristic search by using black-box approaches which require significant training data and time, which make them challenging to use in practice. This paper presents Symphony, a scheduling framework that addresses the challenge in two ways: (i) a domain-driven Bayesian reinforcement learning (RL) model for scheduling, which inherently models the resource dependencies identified from the system architecture; and (ii) a sampling-based technique to compute the gradients of a Bayesian model without performing full probabilistic inference. Together, these techniques reduce both the amount of training data and the time required to produce scheduling policies that significantly outperform black-box approaches by up to 2.2.
AB - The probheterogeneous processors (e.g., CPUs, GPUs, FPGAs)*scheduling of workloads onto is of fundamental importance in modern data centers. Current system schedulers rely on application/system-specific heuristics that have to be built on a case-by-case basis. Recent work has demonstrated ML techniques for automating the heuristic search by using black-box approaches which require significant training data and time, which make them challenging to use in practice. This paper presents Symphony, a scheduling framework that addresses the challenge in two ways: (i) a domain-driven Bayesian reinforcement learning (RL) model for scheduling, which inherently models the resource dependencies identified from the system architecture; and (ii) a sampling-based technique to compute the gradients of a Bayesian model without performing full probabilistic inference. Together, these techniques reduce both the amount of training data and the time required to produce scheduling policies that significantly outperform black-box approaches by up to 2.2.
UR - http://www.scopus.com/inward/record.url?scp=85105120549&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85105120549&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:85105120549
T3 - 37th International Conference on Machine Learning, ICML 2020
SP - 606
EP - 618
BT - 37th International Conference on Machine Learning, ICML 2020
A2 - Daume, Hal
A2 - Singh, Aarti
PB - International Machine Learning Society (IMLS)
T2 - 37th International Conference on Machine Learning, ICML 2020
Y2 - 13 July 2020 through 18 July 2020
ER -