返回
Optimal Policy Characterization Enhanced Proximal Policy Optimization for Multitask Scheduling in Cloud Computing
DOI:10.1109/JIOT.2021.3111414.png)
摘要
En 中文
For a serving system with multiple servers and a public queue, we study the scheduling of multiple tasks with deadlines, under random task arrivals and renewable energy generation. To minimize the weighted sum of the serving cost (associated with the energy consumption) and the delay cost (resulting from deferring the processing of tasks after their deadlines), we formulate the problem as a dynamic program with unknown transition probability. To mitigate the curse of dimensionality, we establish a partial priority rule, the earlier deadline and less demand first (ED-LDF): priority should be given to tasks with earlier deadline and less demand. In the heavy-traffic regime, the established ED-LDF characterization is proved to be optimal under arbitrary system dynamics. We propose a new, scalable ED-LDF-based proximal policy optimization (PPO) approach that integrates our (partial) optimal policy characterizations into the state-of-the-art deep reinforcement learning (DRL) algorithm. Numerical results demonstrate that the proposed ED-LDF-based PPO approach outperforms the classical PPO and three other priority rule-based PPO approaches.
Keyword:
Task analysis
Processor scheduling
Costs
Servers
Cloud computing
Optimization
Optimal scheduling
Deep reinforcement learning (DRL)
delay cost
dynamic programming
mobile-edge computing (MEC)
resource allocation
期刊
IF:
8.9
论文数:
1.4W
被引数:
7.8W
机构
引用论文
NOMA-Enabled Mobile Edge Computing for Internet of Things via Joint Communication and Computation Resource Allocations通过联合通信和计算资源分配实现物联网的NOMA移动边缘计算
Study of bi-directional buck-boost converter topologies for application in electrical vehicle motor drives应用于电动汽车电机驱动的双向buck-boost变换器拓扑研究
Cross-linkable Polymer Matrix for Enhanced Thermal Stability of Succinonitrile-based Polymer Electrolyte in Lithium Rechargeable Batteries可交联聚合物基质,用于增强锂可充电电池中基于丁二腈的聚合物电解质的热稳定性

