Dynamic Multi‐Objective Workflow Scheduling Model in Cloud Environment Based on Adaptive Mutation Strategy

ABSTRACT In the cloud computing environment, workflow scheduling presents a significant challenge due to the unpredictable and dynamic nature of user demands and cloud resources. To address the complexities of workflow scheduling, this paper introduces a dynamic multi‐objective workflow scheduling m...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Concurrency and computation Ročník 37; číslo 4-5
Hlavní autoři: Ye, Tao, Cui, Zhihua
Médium: Journal Article
Jazyk:angličtina
Vydáno: Hoboken, USA John Wiley & Sons, Inc 28.02.2025
Wiley Subscription Services, Inc
Témata:
Adaptive algorithms
adaptive mutation strategy
Cloud computing
Completion time
DRVEA
dynamic many‐objective optimization
Evolutionary algorithms
evolutionary computation
Mutation
Optimization
Task scheduling
Workflow
workflow scheduling model
ISSN:1532-0626, 1532-0634
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:ABSTRACT In the cloud computing environment, workflow scheduling presents a significant challenge due to the unpredictable and dynamic nature of user demands and cloud resources. To address the complexities of workflow scheduling, this paper introduces a dynamic multi‐objective workflow scheduling model that comprehensively considers task completion time, load balancing, as well as dynamic changes in power consumption and cost in real‐world scenarios. To effectively solve this model and better adapt to dynamic multi‐objective optimization problems, we propose a dynamic reference vector guided evolutionary algorithm (DRVEA). The proposed algorithm incorporates an adaptive random mutation strategy, which dynamically adjusts the evolutionary process based on changing optimization goals, thereby enhancing convergence and solution diversity. Experimental results, obtained from both workflow scheduling simulations and standard multi‐objective test environments, demonstrate that the proposed algorithm outperforms existing methods, achieving superior results in both solution quality and adaptability.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1532-0626
1532-0634
DOI:10.1002/cpe.8363