Data Centers Job Scheduling with Deep Reinforcement Learning

33Citations
Citations of this article
48Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Efficient job scheduling on data centers under heterogeneous complexity is crucial but challenging since it involves the allocation of multi-dimensional resources over time and space. To adapt the complex computing environment in data centers, we proposed an innovative Advantage Actor-Critic (A2C) deep reinforcement learning based approach called A2cScheduler for job scheduling. A2cScheduler consists of two agents, one of which, dubbed the actor, is responsible for learning the scheduling policy automatically and the other one, the critic, reduces the estimation error. Unlike previous policy gradient approaches, A2cScheduler is designed to reduce the gradient estimation variance and to update parameters efficiently. We show that the A2cScheduler can achieve competitive scheduling performance using both simulated workloads and real data collected from an academic data center.

Cite

CITATION STYLE

APA

Liang, S., Yang, Z., Jin, F., & Chen, Y. (2020). Data Centers Job Scheduling with Deep Reinforcement Learning. In Lecture Notes in Computer Science (Vol. 12085 LNAI, pp. 906–917). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-47436-2_68

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free