RL-Based Hybrid CPU Scaling for Soft Deadline Constrained Tasks in Container Clouds
Existing CPU scaling approaches have limitations that can lead to inefficient resource allocation and increased penalty costs for tasks with soft deadlines running in container clouds. First, quota allocation based approaches overlook the gap between the obtainable CPU time and allocated quota, causing inefficient CPU utilization and unexpected task behaviors. Second, core allocation based approaches ignore workload dynamics within decision intervals, potentially increasing contention for CPU time among tasks on the same core. Third, existing approaches lack strategies to allocate more resources to critical tasks that incur higher penalty costs when the node’s capacity is insufficient. This article proposes a reinforcement learning based hybrid CPU scaling approach that allocates quota and cores jointly, aiming to minimize penalty costs for timeouts. Based on the embedding generated from a fine-grained CPU demand series, we allocate CPU quotas and determine a dynamic workload-aware core sharing scheme using an attention mechanism that combines respective demands and global criticality regarding penalty costs. Additionally, we integrate the resource gap, CPU time contention, and penalty costs into the reward function to update our model online. The experimental results show the proposed approach achieves state-of-the-art performance.
Authors
- Yepeng Zhang (ORCID: https://orcid.org/0009-0005-6644-0468)
- Haitao Zhang (ORCID: https://orcid.org/0000-0002-9131-3517)
- Huadóng Ma (ORCID: https://orcid.org/0000-0002-7199-5047)
Institutions
- Beijing University of Posts and Telecommunications (CN)
Publication Details
- Journal
- IEEE Transactions on Parallel and Distributed Systems
- Published
- 2025-08-08
- DOI
- https://doi.org/10.1109/tpds.2025.3597195
- Primary Topic
- Cloud Computing and Resource Management
- Type
- article
- Field-Weighted Citation Impact
- 0.00