A scheduling strategy for multiple QoS constrained grid workflows

WMS (Workflow Management System) are gaining popularity in recent years. Most scheduling algorithms developed for WMS focus on a single QoS requirement or a single workflow. However, WMS should serve for many users. And different users have different QoS requirements, the scheduling algorithm should be developed for multiple workflows with different QoS requirements. The scheduler should satisfy every user's QoS requirements and find an optimal schedule. In this paper, we introduce a Multiple QoS Scheduling Strategy of Multi-Workflows (MQSS) to address this problem on the basis of our previous work. Experimentation shows that our strategy is able to increase the scheduling success rate and find an optimal solution.

[1]  Li-zhen Cui,et al.  A Multiple QoS Constrained Scheduling Strategy of Multiple Workflows for Cloud Computing , 2009, 2009 IEEE International Symposium on Parallel and Distributed Processing with Applications.

[2]  Radu Prodan,et al.  Scheduling of scientific workflows in the ASKALON grid environment , 2005, SGMD.

[3]  Geoffrey C. Fox,et al.  Workflow in Grid Systems , 2004 .

[4]  Hai Jin,et al.  A throughput maximization strategy for scheduling transaction‐intensive workflows on SwinDeW‐G , 2008, Concurr. Comput. Pract. Exp..

[5]  Weisong Shi,et al.  An Adaptive Rescheduling Strategy for Grid Workflow Applications , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[6]  R. Buyya,et al.  A budget constrained scheduling of workflow applications on utility Grids using genetic algorithms , 2006, 2006 Workshop on Workflows in Support of Large-Scale Science.

[7]  Rajkumar Buyya,et al.  Workflow scheduling algorithms for grid computing , 2008 .

[8]  Danilo Ardagna,et al.  Adaptive Service Composition in Flexible Processes , 2007, IEEE Transactions on Software Engineering.

[9]  Rajkumar Buyya,et al.  Cost-based scheduling of scientific workflow applications on utility grids , 2005, First International Conference on e-Science and Grid Computing (e-Science'05).

[10]  Rizos Sakellariou,et al.  Scheduling multiple DAGs onto heterogeneous systems , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[11]  Adam Arbree,et al.  Mapping Abstract Complex Workflows onto Grid Environments , 2003, Journal of Grid Computing.

[12]  Ken Kennedy,et al.  TaskScheduling Strategies forWorkflow-based Applications inGrids , 2005 .

[13]  Geoffrey Fox,et al.  Special Issue: Workflow in Grid Systems , 2006, Concurr. Comput. Pract. Exp..

[14]  Elisa Heymann,et al.  Analysis of Dynamic Heuristics for Workflow Scheduling on Grid Systems , 2006, 2006 Fifth International Symposium on Parallel and Distributed Computing.

[15]  Rizos Sakellariou,et al.  A hybrid heuristic for DAG scheduling on heterogeneous systems , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[16]  Ken Kennedy,et al.  Scheduling strategies for mapping application workflows onto the grid , 2005, HPDC-14. Proceedings. 14th IEEE International Symposium on High Performance Distributed Computing, 2005..

[17]  Weisong Shi,et al.  A Planner-Guided Scheduling Strategy for Multiple Workflow Applications , 2008, 2008 International Conference on Parallel Processing - Workshops.

[18]  Salim Hariri,et al.  Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing , 2002, IEEE Trans. Parallel Distributed Syst..

[19]  Rajkumar Buyya,et al.  A Dynamic Critical Path Algorithm for Scheduling Scientific Workflow Applications on Global Grids , 2007, Third IEEE International Conference on e-Science and Grid Computing (e-Science 2007).