Cost minimization under deadline-constraint-based workflow scheduling described by Directed Acyclic Graph (DAG) is a NP-hard problem in Cloud Environment. In order to address such problem, this paper proposes a novel heuristics approach of Concurrent-Level-based Workflow Scheduling (CLWS). It stratifies all the tasks according to the concurrence among tasks during the actual workflow execution. CLWS distributes the total redundancy time into every level according to their concurrent degree. As well as it adopts the algorithm of Markov Decision Process (MDP) to optimize tasks, which have time dependence with each other in the same level. The Simulation results show that CLWS can give a better optimized result. © 2014 Springer International Publishing.
CITATION STYLE
Tan, W., Lu, G., Sun, Y., & Zhang, Z. (2014). A concurrent level based scheduling for workflow applications within cloud computing environment. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8351 LNCS, pp. 400–411). Springer Verlag. https://doi.org/10.1007/978-3-319-09265-2_41
Mendeley helps you to discover research relevant for your work.