Workflow scheduling in IaaS clouds with the optimal pairing between tasks and virtual machines
Year: 2025
Type: article
Abstract: Workflow scheduling in Infrastructure-as-a-Service (IaaS) cloud environments presents significant challenges due to the heterogeneity and dynamic variability of virtualized resources. Traditional approaches often overlook the detailed relationship between specific task requirements and virtual machine (VM) configurations. In this study, we define these relationships as sensitivity. The paper introduces a sensitivity-aware scheduling framework that optimally pairs tasks with VMs based on their resource sensitivities. A Deep Q-Network (DQN)-based reinforcement learning model is proposed to dynamically allocate tasks and adapt VM resource configurations, thereby minimizing both execution time and resource over-provisioning. Experimental results demonstrate that the proposed OPDQN (Optimally Pairs and Deep Q-Network) method consistently outperforms state-of-the-art algorithms such as NHGCPM, VPSS, and DARS in terms of average execution time, CPU resource consumption and alignment between task sensitivities and virtual machine configurations across varying workflow complexities.
Authors: Xianmei Hua, Lubin Zheng
Language: English
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $1,990
OpenAlex ID: W4414465246