Workflow scheduling in IaaS clouds with the optimal pairing between tasks and virtual machines

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

Institutions

Publication Details

Journal
Journal of King Saud University - Computer and Information Sciences
Published
2025-09-24
DOI
https://doi.org/10.1007/s44443-025-00260-7
Primary Topic
Distributed and Parallel Computing Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Workflow scheduling in IaaS clouds with the optimal pairing between tasks and virtual machines

Xianmei Hua, Zheng Lu-Bin
Journal of King Saud University - Computer and Information Sciences
Distributed and Parallel Computing Systems
article

Workflow scheduling in IaaS clouds with the optimal pairing between tasks and virtual machines

Xianmei Hua, Zheng Lu-Bin
article en

Abstract

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.

Journal of King Saud University - Computer and Information SciencesVol. 37(8)
Xiamen University of Technology (CN)
Openalex Percentile: Top 70%
Distributed and Parallel Computing Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.