In:
Concurrency and Computation: Practice and Experience, Wiley, Vol. 33, No. 16 ( 2021-08-25)
Abstract:
Cloud computing is one of the emerging technologies in computer science in which services are provided through the internet on‐demand. Workflow scheduling is considered to be an NP‐hard problem and has a significant issue in the cloud environment. Finding the polynomial‐time solutions for workflow scheduling problem is difficult with most of the existing algorithms designed for traditional computing platforms. Some existing meta‐heuristics algorithms proposed for workflow scheduling problem are stuck in the local optimal solution and fails to give the global optimal solution. In this article, a hybrid of particle swarm optimization and gray wolf optimization, named the PSO‐GWO algorithm, is proposed for workflow scheduling. The proposed algorithm was tested to reduce the total executing cost (TEC) and total execution time (TET) of the dependent tasks in the cloud computing environment. The proposed algorithm takes advantage of both the standard PSO and GWO algorithms and does not stick in the local optimal solution. The experiment results show that the PSO‐GWO outperformed compared with the standard PSO and GWO algorithm in TEC and TET.
Type of Medium:
Online Resource
ISSN:
1532-0626
,
1532-0634
Language:
English
Publisher:
Wiley
Publication Date:
2021
detail.hit.zdb_id:
2052606-4
SSG:
11
Permalink
