A Concurrent Level Based Scheduling for Workflow Applications within Cloud Computing Environment
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.
Keywordsworkflow scheduling cost/time tradeoff heuristics concurrent level
Unable to display preview. Download preview PDF.
- 1.Bhardwaj, S., Jain, L., Jain, S.: Cloud Computing: A Study of Infrastructure as a Service (IAAS). IJEIT 2(1), 60–63 (2012)Google Scholar
- 4.Hai, J., Hanhua, C., Zhipeng, L., Xiaoming, N.: QoS Optimizing Model and Solving for Composite Service in CGSP Job Manager. Chinese Journal of Computers 28(4), 578–588 (2005)Google Scholar
- 5.Jianning, L., Huizhong, W.: Scheduling in Grid Computing Environment Based on Genetic-algorithm. Journal of Computer Research and Development 41(12), 2190–2194 (2004)Google Scholar
- 7.Yu, J., Buyya, R., Tham, C.K.: Cost-Based Scheduling of Scientific Workflow Applications on Utility Grids. In: Proceedings of the 1st IEEE International Conference on e-Science and Grid Computing, pp. 140–147. IEEE Press, Melbourne (2005)Google Scholar
- 8.Yingchun, Y., Xiaoping, L., Qian, W., Yi, Z.: Bottom Level Based Heuristic for Workflow Scheduling in Grids. Chinese Journal of Computers 31(2), 283–290 (2008)Google Scholar
- 10.Amalarethinam, D.I.G., Selvi, F.K.M.: A Minimun Makespan Grid Workflow Scheduling algorithm. Computer Communication and Informatics, 1–6 (2012)Google Scholar
- 11.Blythe, J., Jain, S., Deelman, E., et al.: Task Scheduling Strategies for Workflow-based Applications in Grids. In: Proceedings of the IEEE International Symposium on Cluster Computing and Grid, Cardiff, Wales, UK, pp. 759–767 (2005)Google Scholar
- 13.Sulistio, A., Buyya, R.: A Gird Simulation Infrastructure Supporting Advance Reservation. In: 16th International Conference on Parallel and Distributed Computing and Systems (PDCS 2004). MIT Cambridge, Boston (2004)Google Scholar
- 14.Henan, Z., Sakellariou, R.: A Low-cost Rescheduling Policy for Dependent Tasks on Grid Computing Systems, pp. 21–31. Springer, Berlin (2004)Google Scholar
- 15.Zhifeng, Y., Weisong, S.: An Adaptive Rescheduling Strategy for Gird Workflow Applications. In: Proc. of the International Symposium on Parallel and Distributed Processing. IEEE Press, New York (2007)Google Scholar