z-logo
open-access-imgOpen Access
Deadline-constrained workflow scheduling in software as a service Cloud
Author(s) -
Saeid Abrishami,
Mahmoud Naghibzadeh
Publication year - 2012
Publication title -
scientia iranica
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.299
H-Index - 51
eISSN - 2345-3605
pISSN - 1026-3098
DOI - 10.1016/j.scient.2011.11.047
Subject(s) - computer science , workflow , cloud computing , provisioning , distributed computing , quality of service , scheduling (production processes) , workflow management system , workflow technology , workflow engine , database , operating system , computer network , mathematical optimization , mathematics
The advent of Cloud computing as a new model of service provisioning in distributed systems, encourages researchers to investigate its benefits and drawbacks in executing scientific applications such as workflows. In this model, the users request for available services according to their desired Quality of Service, and they are charged on a pay-per-use basis. One of the most challenging problems in Clouds is workflow scheduling, i.e., the problem of satisfying the QoS of the user as well as minimizing the cost of workflow execution. In this paper, we propose a new QoS-based workflow scheduling algorithm based on a novel concept called Partial Critical Paths (PCP), which tries to minimize the cost of workflow execution while meeting a user-defined deadline. This algorithm recursively schedules the partial critical paths ending at previously scheduled tasks. The simulation results show that the performance of our algorithm is very promising.

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