暂无分享,去创建一个
Minimizing job scheduling time is a fundamental issue in data center networks that has been extensively studied in recent years. The incoming jobs require different CPU and memory units, and span different number of time slots. The traditional solution is to design efficient heuristic algorithms with performance guarantee under certain assumptions. In this paper, we improve a recently proposed job scheduling algorithm using deep reinforcement learning and extend it to multiple server clusters. Our study reveals that deep reinforcement learning method has the potential to outperform traditional resource allocation algorithms in a variety of complicated environments.
[1] Baochun Li,et al. Multi-Resource Round Robin: A low complexity packet scheduler with Dominant Resource Fairness , 2013, 2013 21st IEEE International Conference on Network Protocols (ICNP).
[2] Benjamin Hindman,et al. Dominant Resource Fairness: Fair Allocation of Multiple Resource Types , 2011, NSDI.
[3] Srikanth Kandula,et al. Resource Management with Deep Reinforcement Learning , 2016, HotNets.