Critical Path-Based Ant Colony Optimization for Scientific Workflow Scheduling in Cloud Computing Under Deadline Constraint

Author(s):  
Arvind Lal ◽  
C. Rama Krishna
Author(s):  
Jasraj Meena ◽  
Manu Vardhan

Cloud computing is used to deliver IT resources over the internet. Due to the popularity of cloud computing, nowadays, most of the scientific workflows are shifted towards this environment. There are lots of algorithms has been proposed in the literature to schedule scientific workflows in the cloud, but their execution cost is very high as well as they are not meeting the user-defined deadline constraint. This paper focuses on satisfying the userdefined deadline of a scientific workflow while minimizing the total execution cost. So, to achieve this, we have proposed a Cost-Effective under Deadline (CEuD) constraint workflow scheduling algorithm. The proposed CEuD algorithm considers all the essential features of Cloud and resolves the major issues such as performance variation, and acquisition delay. We have compared the proposed CEuD algorithm with the existing literature algorithms for scientific workflows (i.e., Montage, Epigenomics, and CyberShake) and getting better results for minimizing the overall execution cost of the workflow while satisfying the user-defined deadline.


2015 ◽  
Vol 14 (10) ◽  
pp. 6176-6183
Author(s):  
S.J. Mohana ◽  
Dr.M. Saroja ◽  
Dr.M. Venkatachalam

Cloud computing is a type of parallel and distributed system consisting of a collection of interconnected and virtual computers. This technological trend has enabled the realization of a new computing model called cloud computing, in which shared resources, information,software & other devices are provided according to client requirement at specific time, are provided as general utilities that can be leased and released by users through the Internet in an on-demand fashion.Cloud workflow scheduling is an NP-hard optimization problem, and many meta-heuristic algorithms have been proposed to solve it.Allocation of resources to a large number of workflows in a cloud computing environment presents more difficulty than in network computational environments.A good task scheduler should adapt its scheduling strategy to the changing environment and the types of tasks. In this work, modified ant colony optimization for cloud task scheduling is proposed. The goal of modification is to enhance the performance of the basic ant colony optimization algorithm and optimize the task execution time in view of minimizing the makespan of a given tasks set.


2013 ◽  
Vol 32 (5) ◽  
pp. 1418-1420
Author(s):  
Chun-yan ZHANG ◽  
Qing-lin LIU ◽  
Ke MENG

Sign in / Sign up

Export Citation Format

Share Document