Job Scheduling in Datacenters using Constraint Controlled RL
Vanamala Venkataswamy

TL;DR
This paper introduces a novel constraint-controlled reinforcement learning approach using PID Lagrangian methods for online job scheduling in green datacenters, balancing revenue maximization and delay minimization amid intermittent renewable energy supply.
Contribution
It proposes a new RL-based scheduler employing PID control for Lagrange multipliers, effectively managing multiple conflicting objectives in green datacenter job scheduling.
Findings
Improved scheduling performance over baseline policies.
Effective handling of multiple objectives simultaneously.
Stable learning dynamics achieved through PID control.
Abstract
This paper studies a model for online job scheduling in green datacenters. In green datacenters, resource availability depends on the power supply from the renewables. Intermittent power supply from renewables leads to intermittent resource availability, inducing job delays (and associated costs). Green datacenter operators must intelligently manage their workloads and available power supply to extract maximum benefits. The scheduler's objective is to schedule jobs on a set of resources to maximize the total value (revenue) while minimizing the overall job delay. A trade-off exists between achieving high job value on the one hand and low expected delays on the other. Hence, the aims of achieving high rewards and low costs are in opposition. In addition, datacenter operators often prioritize multiple objectives, including high system utilization and job completion. To accomplish the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCloud Computing and Resource Management · Neural Networks and Reservoir Computing · Data Stream Mining Techniques
