Deadline constraint heuristic-based genetic algorithm for workflow scheduling in cloud Online publication date: Wed, 29-Oct-2014
by Amandeep Verma; Sakshi Kaushal
International Journal of Grid and Utility Computing (IJGUC), Vol. 5, No. 2, 2014
Abstract: Task scheduling and resource allocation are the key challenges of cloud computing. Compared with grid environment, data transfer is a big overhead for cloud workflows. So, the cost arising from data transfers between resources as well as execution costs must also be taken into account during scheduling based upon user's Quality of Service (QoS) constraints. In this paper, we present Deadline Constrained Heuristic based Genetic Algorithms (HGAs) to schedule applications to cloud resources that minimise the execution cost while meeting the deadline for delivering the result. Each workflow's task is assigned priority using bottom-level (b-level) and top-level (t-level). To increase the population diversity, these priorities are then used to create the initial population of HGAs. The proposed algorithms are simulated and evaluated with synthetic workflows based on realistic workflows. The simulation results show that our proposed algorithms have a promising performance as compared to Standard Genetic Algorithm (SGA).
Online publication date: Wed, 29-Oct-2014
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Grid and Utility Computing (IJGUC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org