Dynamic multi-objective workflow scheduling for combined resources in cloud

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...

Full description

Saved in:
Bibliographic Details
Published in:Simulation modelling practice and theory Vol. 129; p. 102835
Main Authors: Zhang, Yan, Wu, Linjie, Li, Mengxia, Zhao, Tianhao, Cai, Xingjuan
Format: Journal Article
Language:English
Published: Elsevier B.V 01.12.2023
Subjects:
Dynamic multi-objective evolutionary algorithms
Dynamic price
Initial weight vector construction
Spot instances
Workflow scheduling
Initial weight vector construction
Dynamic multi-objective evolutionary algorithms
Workflow scheduling
Spot instances
Dynamic price
ISSN:1569-190X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1569-190X
DOI:10.1016/j.simpat.2023.102835