doi: 10.4304/jsw.9.4.926-930
QoS Constraint Based Workflow Scheduling for Cloud Computing Services
- 1 School of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing P.R.China
- 2 School of Computer and Information, Shanghai Second Polytechnic University, Shanghai, P.R.China
Abstract
QoS constraint based workflow schedulingdescribed by Directed Acyclic Graph (DAG) has beenproved to be a NP-hard problem in Cloud ComputingServices, especially for cost minimization under deadlineconstraint. Due to Deadline Bottom Level (DBL) hasn’tconsidered the concurrence during the real executingprocess that cause much more shatter time to solve suchproblem, this paper proposes a novel heuristics approach ofConcurrent Level based Workflow Scheduling (CLWS). Itstratifies all the tasks according to the concurrence amongtasks in the actual workflow execution. Then, CLWSdistributes the total redundancy time into every levelaccording to their concurrent degree. The simulationexperiments show that CLWS makes a better improvementthan DBL.
Keywords
- workflow scheduling
- cost/time tradeoff
How to Cite
Guangzhen Lu, Wen’an Tan, Yong Sun, Zijian Zhang, and Anqiong Tang, "QoS Constraint Based Workflow Scheduling for Cloud Computing Services," Journal of Software, vol. 9, no. 4, pp. 926-930, 2014. https://doi.org/ 10.4304/jsw.9.4.926-930
Copyright & License
Copyright © 2014 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).