An extended Intelligent Water Drops algorithm for workflow scheduling in cloud computing environment

• Published in: Egyptian informatics journal Vol. 19; no. 1; pp. 33 - 55
• Main Authors: Elsherbiny, Shaymaa, Eldaydamony, Eman, Alrahmawy, Mohammed, Reyad, Alaa Eldin
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.03.2018; Elsevier
• Subjects: Cloud computing; Intelligent Water Drops; Natural-based algorithms; Resource management; Scheduling algorithms; Workflow scheduling; Cloud computing; Intelligent Water Drops; Scheduling algorithms; Resource management; Workflow scheduling; Natural-based algorithms
• ISSN: 1110-8665; 2090-4754; 2090-4754
• DOI: 10.1016/j.eij.2017.07.001

Cloud computing is emerging as a high performance computing environment with a large scale, heterogeneous collection of autonomous systems and flexible computational architecture. Many resource management methods may enhance the efficiency of the whole cloud computing system. The key part of cloud computing resource management is resource scheduling. Optimized scheduling of tasks on the cloud virtual machines is an NP-hard problem and many algorithms have been presented to solve it. The variations among these schedulers are due to the fact that the scheduling strategies of the schedulers are adapted to the changing environment and the types of tasks. The focus of this paper is on workflows scheduling in cloud computing, which is gaining a lot of attention recently because workflows have emerged as a paradigm to represent complex computing problems. We proposed a novel algorithm extending the natural-based Intelligent Water Drops (IWD) algorithm that optimizes the scheduling of workflows on the cloud. The proposed algorithm is implemented and embedded within the workflows simulation toolkit and tested in different simulated cloud environments with different cost models. Our algorithm showed noticeable enhancements over the classical workflow scheduling algorithms. We made a comparison between the proposed IWD-based algorithm with other well-known scheduling algorithms, including MIN-MIN, MAX-MIN, Round Robin, FCFS, and MCT, PSO and C-PSO, where the proposed algorithm presented noticeable enhancements in the performance and cost in most situations.