Abstract

Scheduling of scientific workflows on hybrid cloud architecture, which contains private and public clouds, is a challenging task because schedulers should be aware of task inter-dependencies, underlying heterogeneity, cost diversity, and virtual machine (VM) variable configurations during the scheduling process. On the one side, reaching a minimum total execution time or makespan is a favorable issue for users whereas the cost of utilizing quicker VMs may lead to conflict with their budget on the other side. Existing works in the literature scarcely consider VM’s monetary cost in the scheduling process but mainly focus on makespan. Therefore, in this paper, the problem of scientific workflow scheduling running on hybrid cloud architecture is formulated to a bi-objective optimization problem with makespan and monetary cost minimization viewpoint. To address this combinatorial discrete problem, this paper presents a hybrid bi-objective optimization based on simulated annealing and task duplication algorithms (BOSA-TDA) that exploits two important heuristics heterogeneous earliest finish time (HEFT) and duplication techniques to improve canonical SA. The extensive simulation results reported of running different well-known scientific workflows such as LIGO, SIPHT, Cybershake, Montage, and Epigenomics demonstrate that proposed BOSA-TDA has the amount of 12.5%, 14.5%, 17%, 13.5%, and 18.5% average improvement against other existing approaches in terms of makespan, monetary cost, speed up, SLR, and efficiency metrics, respectively.

Highlights

  • Information technology (IT) was undergone a revolution

  • To solve the discrete bi-objective workflow scheduling problem, this paper extends a hybrid population-based biobjective optimization algorithm based on simulated annealing and task duplication scheduling techniques in such a way that it can cover existing aforementioned shortcomings

  • Lookahead, heterogeneous earliest finish time (HEFT)-TD, NSGAII, and Single objective GA (SOGA) algorithms are placed in the ranking list from the best to the worst, but after the BOSATDA which is in the first place

Read more

Summary

Introduction

Information technology (IT) was undergone a revolution. In this line, cloud computing attracted great attention in both industries and research communities for the sake of its pervasiveness, elasticity, and economy of scale [1]. A novel hybrid discrete particle swarm optimization (HDPSO) algorithm was proposed to reduce maximum workflow execution time on cloud heterogeneous platforms [1]. To do so, this problem has been formulated into a single objective optimization problem. The most important innovation of the current paper which it conveys is that it formulates workflow scheduling problems on cloud platforms with makespan and monetary cost viewpoints. This is a bi-objective optimization problem under some constraints which is an NP-Hard problem. Genetic Algorithm (GA) [31]–[34] Simulated Annealing(SA) [35]–[38] Particle Swarm Optimization(PSO) [39]–[44] Ant Colony Optimization(ACO) [45]– [51] Artificial Bee Colony (ABC) [52] Cuckoo Search algorithm(CS) [53]

Related works
MutationTask procedure
MutatationDuplication procedure
Experiments
Conclusion and future work
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