Bi-level fuzzy based advanced reservation of Cloud workflow applications on distributed Grid resources

The increasing demand on execution of large-scale Cloud workflow applications which need a robust and elastic computing infrastructure usually lead to the use of high-performance Grid computing clusters. As the owners of Cloud applications expect to fulfill the requested Quality of Services (QoS) by the Grid environment, an adaptive scheduling mechanism is needed which enables to distribute a large number of related tasks with different computational and communication demands on multi-cluster Grid computing environments. Addressing the problem of scheduling large-scale Cloud workflow applications onto multi-cluster Grid environment regarding the QoS constraints declared by application’s owner is the main contribution of this paper. Heterogeneity of resource types (service type) is one of the most important issues which significantly affect workflow scheduling in Grid environment. On the other hand, a Cloud application workflow is usually consisting of different tasks with the need for different resource types to complete which we call it heterogeneity in workflow. The main idea which forms the soul of all the algorithms and techniques introduced in this paper is to match the heterogeneity in Cloud application’s workflow to the heterogeneity in Grid clusters. To obtain this objective a new bi-level advanced reservation strategy is introduced, which is based upon the idea of first performing global scheduling and then conducting local scheduling. Global-scheduling is responsible to dynamically partition the received DAG into multiple sub-workflows that is realized by two collaborating algorithms: (1) The Critical Path Extraction algorithm (CPE) which proposes a new dynamic task overall critically value strategy based on DAG’s specification and requested resource type QoS status to determine the criticality of each task; and (2) The DAG Partitioning algorithm (DAGP) which introduces a novel dynamic score-based approach to extract sub-workflows based on critical paths by using a new Fuzzy Qualitative Value Calculation System to evaluate the environment. Local-scheduling is responsible for scheduling tasks on suitable resources by utilizing a new Multi-Criteria Advance Reservation algorithm (MCAR) which simultaneously meets high reliability and QoS expectations for scheduling distributed Cloud-base applications. We used the simulation to evaluate the performance of the proposed mechanism in comparison with four well-known approaches. The results show that the proposed algorithm outperforms other approaches in different QoS related terms.

[1]  Layuan Li,et al.  Optimal resource provisioning for cloud computing environment , 2012, The Journal of Supercomputing.

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

[3]  Stefano Modafferi,et al.  Partitioning rules for orchestrating mobile information systems , 2004, Personal and Ubiquitous Computing.

[4]  Wei Tan,et al.  Dynamic workflow model fragmentation for distributed execution , 2007, Comput. Ind..

[5]  Hesham H. Ali,et al.  Task scheduling in parallel and distributed systems , 1994, Prentice Hall series in innovative technology.

[6]  Annika Kangas,et al.  MCDM methods in strategic planning of forestry on state‐owned lands in Finland: applications and experiences , 2001 .

[7]  T. Saaty Fundamentals of Decision Making and Priority Theory With the Analytic Hierarchy Process , 2000 .

[8]  Rajkumar Buyya,et al.  Adapting Market-Oriented Scheduling Policies for Cloud Computing , 2010, ICA3PP.

[9]  Radu Prodan,et al.  Dynamic Cloud provisioning for scientific Grid workflows , 2010, 2010 11th IEEE/ACM International Conference on Grid Computing.

[10]  Nawwaf N. Kharma,et al.  A high performance algorithm for static task scheduling in heterogeneous distributed computing systems , 2008, J. Parallel Distributed Comput..

[11]  Thomas L. Saaty Fundamentals of decision making and priority theory , 2000 .

[12]  Radu Prodan,et al.  Bi-Criteria Scheduling of Scientific Grid Workflows , 2010, IEEE Transactions on Automation Science and Engineering.

[13]  George N. Rouskas,et al.  Online algorithms for advance resource reservations , 2011, J. Parallel Distributed Comput..

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

[15]  Boontee Kruatrachue,et al.  Static task scheduling and grain packing in parallel processing systems , 1987 .

[16]  Ewa Deelman,et al.  Pegasus: Mapping Large-Scale Workflows to Distributed Resources , 2007, Workflows for e-Science, Scientific Workflows for Grids.

[17]  Jin-Soo Kim,et al.  BTS: Resource capacity estimate for time-targeted science workflows , 2011, J. Parallel Distributed Comput..

[18]  Dennis Gannon,et al.  Workflows for e-Science, Scientific Workflows for Grids , 2014 .

[19]  Jia Yan,et al.  A Role-Based Approach for Decentralized Dynamic Service Composition , 2005 .

[20]  Jin-Soo Kim,et al.  Cost optimized provisioning of elastic resources for application workflows , 2011, Future Gener. Comput. Syst..

[21]  Jiuxin Cao,et al.  Dynamic multi-resource advance reservation in grid environment , 2008, The Journal of Supercomputing.

[22]  Yang Yu,et al.  QoS Constrained Grid Workflow Scheduling Optimization Based on a Novel PSO Algorithm , 2009, 2009 Eighth International Conference on Grid and Cooperative Computing.

[23]  George J. Klir,et al.  Fuzzy sets and fuzzy logic - theory and applications , 1995 .

[24]  Chunlin Li,et al.  Resource scheduling with conflicting objectives in grid environments: Model and evaluation , 2009, J. Netw. Comput. Appl..

[25]  Rajkumar Buyya,et al.  Scheduling scientific workflow applications with deadline and budget constraints using genetic algorithms , 2006, Sci. Program..

[26]  Jemal H. Abawajy Adaptive hierarchical scheduling policy for enterprise grid computing systems , 2009, J. Netw. Comput. Appl..

[27]  Fatma A. Omara,et al.  Genetic algorithms for task scheduling problem , 2010, J. Parallel Distributed Comput..

[28]  Nawwaf N. Kharma,et al.  A hybrid heuristic-genetic algorithm for task scheduling in heterogeneous processor networks , 2011, J. Parallel Distributed Comput..

[29]  Enis Afgan,et al.  Scheduling and planning job execution of loosely coupled applications , 2011, The Journal of Supercomputing.

[30]  Ishfaq Ahmad,et al.  Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors , 1996, IEEE Trans. Parallel Distributed Syst..

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

[32]  Edward A. Lee,et al.  A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures , 1993, IEEE Trans. Parallel Distributed Syst..

[33]  Daniel S. Katz,et al.  Pegasus: A framework for mapping complex scientific workflows onto distributed systems , 2005, Sci. Program..

[34]  Fangpeng Dong Workflow Scheduling Algorithms in the Grid , 2009 .

[35]  Radu Prodan,et al.  Performance and cost optimization for multiple large-scale grid workflow applications , 2007, Proceedings of the 2007 ACM/IEEE Conference on Supercomputing (SC '07).

[36]  Henri Casanova,et al.  On cluster resource allocation for multiple parallel task graphs , 2010, J. Parallel Distributed Comput..

[37]  Mingchu Li,et al.  Flexible service selection with user-specific QoS support in service-oriented architecture , 2012, J. Netw. Comput. Appl..

[38]  Jun Zhang,et al.  An Ant Colony Optimization Approach to a Grid Workflow Scheduling Problem With Various QoS Requirements , 2009, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[39]  Kenli Li,et al.  List scheduling with duplication for heterogeneous computing systems , 2010, J. Parallel Distributed Comput..

[40]  Y.-K. Kwok,et al.  Static scheduling algorithms for allocating directed task graphs to multiprocessors , 1999, CSUR.

[41]  Manpreet Kaur,et al.  Contention-Aware Scheduling with Task Duplication , 2009, JSSPP.

[42]  Kevin Curran,et al.  Discovering Resources in Computational GRID Environments , 2006, The Journal of Supercomputing.

[43]  Rajkumar Buyya,et al.  A Particle Swarm Optimization-Based Heuristic for Scheduling Workflow Applications in Cloud Computing Environments , 2010, 2010 24th IEEE International Conference on Advanced Information Networking and Applications.

[44]  Stephen A. Jarvis,et al.  Grid load balancing using intelligent agents , 2005, Future Gener. Comput. Syst..

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

[46]  George N. Rouskas,et al.  On the Design of Online Scheduling Algorithms for Advance Reservations and QoS in Grids , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[47]  Luciano Baresi,et al.  Workflow Partitioning in Mobile Information Systems , 2004, MOBIS.

[48]  Rajkumar Buyya,et al.  A taxonomy of scientific workflow systems for grid computing , 2005, SGMD.

[49]  Maozhen Li,et al.  Enhancing genetic algorithms for dependent job scheduling in grid computing environments , 2012, The Journal of Supercomputing.

[50]  T. Ross Fuzzy Logic with Engineering Applications , 1994 .

[51]  Rizos Sakellariou,et al.  Scheduling Data-IntensiveWorkflows onto Storage-Constrained Distributed Resources , 2007, Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07).