Abstract

There are several scientific workflow applications which need vast amount of processing so the cloud offerings give the sense of economic. Workflow scheduling has drastic impact on gaining desired quality of service (QoS). The main objective of workflow scheduling is to minimize the makespan. The workflow scheduling is formulated to a discrete optimization problem which is NP-Hard. This paper presents a novel discrete grey wolf optimizer (D-GWO) for scientific workflow scheduling problems in heterogeneous cloud computing platforms in the aim of minimizing makespan. Although the original GWO had great achievements in continuous optimization problems, it seems clear gap in utilizing GWO for combinatorial discrete optimization problems. It revolves around the fact that the continuous changes in search space during the course of discrete optimization lead inefficient or meaningless solutions. To this end, the proposed algorithm is customized in such a way to optimize discrete workflow scheduling problem by leveraging some new binary operators and Walking Around approaches to balance between exploration and exploitation in discrete search space. Scientific unstructured workflows were investigated in different circumstances to prove effectiveness of proposed novel meta-heuristic algorithm. The simulation results witnessed the superiority of proposed D-GWO against other state-of-the-arts in terms of scheduling metrics.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call