arrow
Return

Dynamic multi-objective workflow scheduling for combined resources in cloud

delete2023-12-01
delete5
PRE
AI
张彦 cover
张彦 (Yan Zhang)
L
Linjie Wu
李梦霞 cover
李梦霞 (Mengxia Li)
T
Tianhao Zhao
蔡星娟 (Xingjuan Cai) *
DOI:10.1016/j.simpat.2023.102835delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Cloud resource providers offer idle resources to users as spot instances. The price of the instances changes with market supply and demand, and the dynamic price can have a significant impact on workflow scheduling. In this work, we use a combination of spot and on-demand instances as the foundation cloud resource and characterize the dynamic workflow scheduling problem as a dynamic multi-objective optimization problem (DMOP), where the dynamics originate from the dynamic price of spot instances. The scheduling solution is found by considering three objectives: maximizing the reliability of the instances while minimizing the makespan and cost. In addition, we provide an enhanced MOEAD algorithm called MOEA/D-URDI that combines diversity introduction and uniform random sampling, where the uniform random sampling paradigm is used to generate the initial weight vector. The dynamic multi-objective optimization evolutionary algorithm DMOEA/D-URDI is then created by combining the method with a dynamic optimization framework. Our technique beats existing algorithms, according to experimental data based on dynamic benchmark sets and three well-known scientific procedures in terms of metrics on dynamic benchmark sets and better ensures reliability in scheduling scientific workflows while reducing makespan and cost.
Keywords:
Workflow scheduling
Dynamic price
Dynamic multi-objective evolutionary
algorithms
Spot instances
Initial weight vector construction

Journal

Simulation Modelling Practice and Theory cover
Simulation Modelling Practice and Theory
IF:
4.6
Papers:
2.6K
Citations:
4.8K

Organization

T
taiyuan university of science & technology
Scholars:
3.5K
Papers: 2.3K
Citations: 3