A priority constrained scheduling strategy of multiple workflows for cloud computing

Cloud computing has emerged as a new paradigm for solving large-scale problems. To provide good performance in cloud computing, many algorithms have been investigated. However, there is a conflict between fairness in scheduling and user's priority. This paper proposed a novel algorithm PISA that both considered fairness and consumers' priority. The algorithm can schedule multiple workflows which are specified priority and the task weights are taken into account. Experimentation shows that our algorithm is able to increase the scheduling success rate significantly.

[1]  Li Wenhao,et al.  A community cloud oriented workflow system framework and its scheduling strategy , 2010, 2010 IEEE 2nd Symposium on Web Society.

[2]  Xiao Liu,et al.  Handling Recoverable Temporal Violations in Scientific Workflow Systems: A Workflow Rescheduling Based Strategy , 2010, 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing.

[3]  Ravi S. Sandhu,et al.  Role-Based Access Control Models , 1996, Computer.

[4]  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.

[5]  Thomas Sandholm,et al.  Dynamic Proportional Share Scheduling in Hadoop , 2010, JSSPP.

[6]  Scott Shenker,et al.  Delay scheduling: a simple technique for achieving locality and fairness in cluster scheduling , 2010, EuroSys '10.