Cost and makespan aware workflow scheduling in IaaS clouds using hybrid spider monkey optimization

Abstract

The researcher's predilection towards the concerned infinite resources and the dynamic provisioning on rental premises encourages the scheduling of complex scientific applications in the cloud. The scheduling of workflows in the cloud is constrained to QoS parameters. Many heuristic and meta-heuristic algorithms are widely investigated for the QoS constrained workflow scheduling problem. However, it is still an open area of research, as most of the existing techniques concentrate on minimization of either cost or time and ignores the optimization of multiple QoS constraints simultaneously. To address this problem, in this paper, a Hybrid Spider Monkey Optimization (HSMO) algorithm has been proposed. The proposed algorithm optimizes the makespan and the cost while satisfying the budget and deadline constraints. The proposed algorithm is the hybridization of recently developed SMO and the other popular heuristic BDSD algorithm. BDSD is a budget and deadline constrained algorithm, which guides HSMO in generating a feasible schedule. Moreover, the proposed strategy involves the penalty function to restrict selecting those solutions that fail to satisfy the QoS constraints. Experimental results demonstrate the effectiveness of HSMO over existing ABC, Bi-Criteria PSO, and BDSD algorithms.