z-logo
open-access-imgOpen Access
Time Effective Workflow Scheduling using Genetic Algorithm in Cloud Computing
Author(s) -
Rohit Nagar,
Deepak Kumar Gupta,
Raj Mohan Singh
Publication year - 2018
Publication title -
international journal of information technology and computer science
Language(s) - English
Resource type - Journals
eISSN - 2074-9015
pISSN - 2074-9007
DOI - 10.5815/ijitcs.2018.01.08
Subject(s) - computer science , cloud computing , workflow , distributed computing , scheduling (production processes) , genetic algorithm , execution time , response time , workflow management system , the internet , real time computing , mathematical optimization , operating system , database , machine learning , mathematics
Cloud computing is service based technology on internet which facilitates users to access plenty of resources on demand from anywhere and anytime in a metered manner i.e. pay per usage without paying much heed to the maintenance and implementation details of application. As cloud technology is evolving day by day it is being confronted by numerous challenges, such as time and cost under deadline constraints. Research work done so far mainly focused on reducing cost as well as execution time. In order to minimize cost and execution time previously existing workflow scheduling model known as predict earliest finish time is used. In this research work we have proposed a new PEFT genetic algorithm approach to further reduce the execution time on this model. A strategy is developed to let GA focus on to optimize chromosomes objective to get best suitable mutated children. After obtaining a feasible solution, the genetic algorithm focuses on optimizing the execution time. Experimental results show that our algorithm can find better solution within lesser time.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom