Skip to main content
Top
Published in: The Journal of Supercomputing 1/2014

01-01-2014

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

Authors: Sahar Adabi, Ali Movaghar, Amir Masoud Rahmani

Published in: The Journal of Supercomputing | Issue 1/2014

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

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.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Appendix
Available only for authorised users
Literature
1.
go back to reference Castillo C, Rouskas GN, Harfoush K (2007) On the design of online scheduling algorithms for advance reservations and QoS in grids. In: IEEE international parallel and distributed processing symposium, IPDPS Castillo C, Rouskas GN, Harfoush K (2007) On the design of online scheduling algorithms for advance reservations and QoS in grids. In: IEEE international parallel and distributed processing symposium, IPDPS
2.
go back to reference Wieczorek M, Prodan R, Fahringer T (2005) Scheduling of scientific workflows in the ASKALON grid environment. ACM SIGMOD Rec 34(3):56–62CrossRef Wieczorek M, Prodan R, Fahringer T (2005) Scheduling of scientific workflows in the ASKALON grid environment. ACM SIGMOD Rec 34(3):56–62CrossRef
3.
go back to reference Ramakrishnan A, Singh G, Zhao H, Deelman E, Sakellariou R, Vahi K, Blackburn K, Meyers D, Samidi M (2007) Scheduling data intensive workflows onto storage-constrained distributed resources. In: Proceedings of the 7th IEEE symposium on cluster computing and the grid (CCGrid’07) Ramakrishnan A, Singh G, Zhao H, Deelman E, Sakellariou R, Vahi K, Blackburn K, Meyers D, Samidi M (2007) Scheduling data intensive workflows onto storage-constrained distributed resources. In: Proceedings of the 7th IEEE symposium on cluster computing and the grid (CCGrid’07)
4.
go back to reference Yu J, Buyya R (2005) A taxonomy of scientific workflow systems for grid computing. SIGMOD Rec 34(3) Yu J, Buyya R (2005) A taxonomy of scientific workflow systems for grid computing. SIGMOD Rec 34(3)
5.
go back to reference Sih GC, Lee EA (1993) A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures. IEEE Trans Parallel Distrib Syst 4(2):75–87CrossRef Sih GC, Lee EA (1993) A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures. IEEE Trans Parallel Distrib Syst 4(2):75–87CrossRef
6.
go back to reference Kwok W et al (1996) Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessors. IEEE Trans Parallel Distrib Syst 7(5):506–521CrossRef Kwok W et al (1996) Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessors. IEEE Trans Parallel Distrib Syst 7(5):506–521CrossRef
7.
go back to reference Topcuoglu H et al (2002) Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans Parallel Distrib Syst 13(3):260–274CrossRef Topcuoglu H et al (2002) Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans Parallel Distrib Syst 13(3):260–274CrossRef
8.
go back to reference Cheng J, Zeng G (2011) A two-phase approach to process partitioning for execution optimization migrating workflow. J Comput Interdiscip Sci 7:3478–3490 Cheng J, Zeng G (2011) A two-phase approach to process partitioning for execution optimization migrating workflow. J Comput Interdiscip Sci 7:3478–3490
9.
go back to reference Tan W, Fan YS (2007) Dynamic workflow model fragmentation for distributed execution. Comput Ind 58(5):381–391CrossRef Tan W, Fan YS (2007) Dynamic workflow model fragmentation for distributed execution. Comput Ind 58(5):381–391CrossRef
10.
go back to reference Maurino A, Modafferi S (2005) Partitioning rules for orchestrating mobile information systems. Pers Ubiquitous Comput 9(5):291–300CrossRef Maurino A, Modafferi S (2005) Partitioning rules for orchestrating mobile information systems. Pers Ubiquitous Comput 9(5):291–300CrossRef
11.
go back to reference Baresi L, Maurino A, Modafferi S (2005) Workflow partitioning in mobile information systems. Int Fed Inf Process 158:93–106 Baresi L, Maurino A, Modafferi S (2005) Workflow partitioning in mobile information systems. Int Fed Inf Process 158:93–106
12.
go back to reference Liu B, Wang Y, Jia Y, Wu QY (2005) A role-based approach for decentralized dynamic service composition. China J Softw 16(11):1859–1867CrossRefMATH Liu B, Wang Y, Jia Y, Wu QY (2005) A role-based approach for decentralized dynamic service composition. China J Softw 16(11):1859–1867CrossRefMATH
13.
go back to reference Daoud MI et al (2011) A hybrid heuristic–genetic algorithm for task scheduling in heterogeneous processor networks. J Parallel Distrib Comput 71(11):1518–1531CrossRef Daoud MI et al (2011) A hybrid heuristic–genetic algorithm for task scheduling in heterogeneous processor networks. J Parallel Distrib Comput 71(11):1518–1531CrossRef
14.
go back to reference Omara FA et al (2010) Genetic algorithms for task scheduling problem. J Parallel Distrib Comput 70(1):13–22CrossRefMATH Omara FA et al (2010) Genetic algorithms for task scheduling problem. J Parallel Distrib Comput 70(1):13–22CrossRefMATH
15.
go back to reference Sinnen O et al (2011) Contention-aware scheduling with task duplication. J Parallel Distrib Comput, 77–86 Sinnen O et al (2011) Contention-aware scheduling with task duplication. J Parallel Distrib Comput, 77–86
16.
go back to reference Dong F (2009) Workflow scheduling algorithm in grid. PhD thesis Dong F (2009) Workflow scheduling algorithm in grid. PhD thesis
17.
go back to reference El-Rewini H, Lewis T, Ali H (1994) Task scheduling in parallel and distributed systems. PTR Prentice Hall, New York. ISBN:0130992356 El-Rewini H, Lewis T, Ali H (1994) Task scheduling in parallel and distributed systems. PTR Prentice Hall, New York. ISBN:0130992356
18.
go back to reference Wong K, Ahmad I (1999) Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Comput Surv 31(4):406–471CrossRef Wong K, Ahmad I (1999) Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Comput Surv 31(4):406–471CrossRef
19.
go back to reference Casanova H et al (2010) On cluster resource allocation for multiple parallel task graphs. J Parallel Distrib Comput 70(12):1193–1203CrossRefMATH Casanova H et al (2010) On cluster resource allocation for multiple parallel task graphs. J Parallel Distrib Comput 70(12):1193–1203CrossRefMATH
20.
go back to reference Deelman E, Mehta G, Singh G, Su M-H, Vahi K (2007) Pegasus: mapping large-scale workflows to distributed resources. In: Taylor I, Deelman E, Gannon DB, Shields M (eds) Workflows for e-science: scientific workflows for grids. Springer, Berlin Deelman E, Mehta G, Singh G, Su M-H, Vahi K (2007) Pegasus: mapping large-scale workflows to distributed resources. In: Taylor I, Deelman E, Gannon DB, Shields M (eds) Workflows for e-science: scientific workflows for grids. Springer, Berlin
21.
go back to reference Deelman E, Singh G, Su M-H, Blythe J, Gil Y, Kesselman C, Mehta G, Vahi K, Berriman GB, Good J, Laity A, Jacob JC, Katz DS (2005) Pegasus: a framework for mapping complex scientific workflows onto distributed systems. Sci Program 13:219–237 Deelman E, Singh G, Su M-H, Blythe J, Gil Y, Kesselman C, Mehta G, Vahi K, Berriman GB, Good J, Laity A, Jacob JC, Katz DS (2005) Pegasus: a framework for mapping complex scientific workflows onto distributed systems. Sci Program 13:219–237
23.
go back to reference Dong F, Akl SG (2007) Distributed double-level workflow scheduling algorithms for grid computing. J Inf Technol Appl 1(4):261–273 Dong F, Akl SG (2007) Distributed double-level workflow scheduling algorithms for grid computing. J Inf Technol Appl 1(4):261–273
24.
go back to reference Prodan R, Wieczorek M (2010) Bi-criteria scheduling of scientific grid workflows. IEEE Trans Autom Sci Eng 7(2):364–376CrossRef Prodan R, Wieczorek M (2010) Bi-criteria scheduling of scientific grid workflows. IEEE Trans Autom Sci Eng 7(2):364–376CrossRef
25.
go back to reference Duan R, Prodan R, Fahringer T (2007) Performance and cost optimization for multiple large-scale grid workflow applications. In: Proc of the 2007 ACM/IEEE conference on supercomputing, pp 1–12CrossRef Duan R, Prodan R, Fahringer T (2007) Performance and cost optimization for multiple large-scale grid workflow applications. In: Proc of the 2007 ACM/IEEE conference on supercomputing, pp 1–12CrossRef
26.
go back to reference Yu J, Buyya R (2006) Scheduling scientific workflow applications with deadline and budget constraints using genetic algorithms. Sci Program 14(3, 4):217–230 Yu J, Buyya R (2006) Scheduling scientific workflow applications with deadline and budget constraints using genetic algorithms. Sci Program 14(3, 4):217–230
27.
go back to reference Chen WN, Zhang J (2009) An ant colony optimization approach to grid workflow scheduling problem with various QoS requirements. IEEE Trans Syst Man Cybern 39(1):29–43 Chen WN, Zhang J (2009) An ant colony optimization approach to grid workflow scheduling problem with various QoS requirements. IEEE Trans Syst Man Cybern 39(1):29–43
28.
go back to reference Tao Q, Chang H, Yi Y, Gu C, Yu Y (2009) QoS constrained grid workflow scheduling optimization based on a novel PSO algorithm. In: Eighth international conference on grid and cooperative computing, pp 153–159 Tao Q, Chang H, Yi Y, Gu C, Yu Y (2009) QoS constrained grid workflow scheduling optimization based on a novel PSO algorithm. In: Eighth international conference on grid and cooperative computing, pp 153–159
29.
go back to reference Salehi MA, Buyya R (2010) Adapting market-oriented scheduling policies for cloud computing. In: Proceedings of the 10th int’l conference on algorithms and architectures for parallel processing, ICA3PP 2010, pp 351–362 Salehi MA, Buyya R (2010) Adapting market-oriented scheduling policies for cloud computing. In: Proceedings of the 10th int’l conference on algorithms and architectures for parallel processing, ICA3PP 2010, pp 351–362
30.
go back to reference Pandey S, Wu L, Guru S, Buyya R (2010) A particle swarm optimization-based heuristic for scheduling workflow applications in cloud computing environments. In: 24th IEEE international conference on advanced information networking and applications, AINA, pp 400–407CrossRef Pandey S, Wu L, Guru S, Buyya R (2010) A particle swarm optimization-based heuristic for scheduling workflow applications in cloud computing environments. In: 24th IEEE international conference on advanced information networking and applications, AINA, pp 400–407CrossRef
31.
go back to reference Xu M, Cui L, Wang H, Bi Y (2009) A multiple QoS constrained scheduling strategy of multiple workflows for cloud computing. In: IEEE international symposium on parallel and distributed processing with applications, pp 629–634 Xu M, Cui L, Wang H, Bi Y (2009) A multiple QoS constrained scheduling strategy of multiple workflows for cloud computing. In: IEEE international symposium on parallel and distributed processing with applications, pp 629–634
32.
go back to reference Ostermann S, Prodan R, Fahringer T (2010) Dynamic cloud provisioning for scientific grid workflows. In: 11th IEEE/ACM international conference on grid computing, GRID, October 2010, pp 97–104 Ostermann S, Prodan R, Fahringer T (2010) Dynamic cloud provisioning for scientific grid workflows. In: 11th IEEE/ACM international conference on grid computing, GRID, October 2010, pp 97–104
33.
go back to reference Byun E-K, Kee Y-S, Kim J-S, Deelman E, Maeng S (2011) BTS: resource capacity estimate for time-targeted science workflows. J Parallel Distrib Comput 71(6):848–862CrossRef Byun E-K, Kee Y-S, Kim J-S, Deelman E, Maeng S (2011) BTS: resource capacity estimate for time-targeted science workflows. J Parallel Distrib Comput 71(6):848–862CrossRef
35.
go back to reference Chen WN et al (2009) An ant colony optimization approach to grid workflow scheduling problem with various QoS requirements. IEEE Trans Syst Man Cybern 39(1):29–43 Chen WN et al (2009) An ant colony optimization approach to grid workflow scheduling problem with various QoS requirements. IEEE Trans Syst Man Cybern 39(1):29–43
36.
go back to reference Klir GJ (1995) Fuzzy set and fuzzy logic: theory and application. Prentice-Hall, Englewood Cliffs Klir GJ (1995) Fuzzy set and fuzzy logic: theory and application. Prentice-Hall, Englewood Cliffs
37.
go back to reference Ross TJ (1995) Fuzzy logic with engineering applications. McGraw-Hill, New YorkMATH Ross TJ (1995) Fuzzy logic with engineering applications. McGraw-Hill, New YorkMATH
38.
go back to reference Kruatrachue B (1987) Static Task Scheduling and Grain Packing in Parallel Processing Systems. PhD thesis, Oregon State University Kruatrachue B (1987) Static Task Scheduling and Grain Packing in Parallel Processing Systems. PhD thesis, Oregon State University
39.
go back to reference Castillo C et al (2011) Online algorithms for advance resource reservations. J Parallel Distrib Comput, 963–973 Castillo C et al (2011) Online algorithms for advance resource reservations. J Parallel Distrib Comput, 963–973
40.
go back to reference Tang X et al (2010) List scheduling with duplication for heterogeneous computing systems. J Parallel Distrib Comput 70(4):323–329CrossRefMATH Tang X et al (2010) List scheduling with duplication for heterogeneous computing systems. J Parallel Distrib Comput 70(4):323–329CrossRefMATH
41.
go back to reference Zhao L, Ren Y, Li M, Sakurai K (2012) Flexible service selection with user-specific QoS support in service-oriented architecture. J Netw Comput Appl 35(3):962–973CrossRef Zhao L, Ren Y, Li M, Sakurai K (2012) Flexible service selection with user-specific QoS support in service-oriented architecture. J Netw Comput Appl 35(3):962–973CrossRef
42.
go back to reference Chunlin L, Xiu ZJ, Layuan L (2009) Resource scheduling with conflicting objectives in grid environments: model and evaluation. J Netw Comput Appl 32(3):760–769CrossRef Chunlin L, Xiu ZJ, Layuan L (2009) Resource scheduling with conflicting objectives in grid environments: model and evaluation. J Netw Comput Appl 32(3):760–769CrossRef
43.
go back to reference Abawajy JH (2009) Adaptive hierarchical scheduling policy for enterprise grid computing systems. J Netw Comput Appl 32(3):770–779CrossRef Abawajy JH (2009) Adaptive hierarchical scheduling policy for enterprise grid computing systems. J Netw Comput Appl 32(3):770–779CrossRef
44.
go back to reference Kangas J, Kangas A, Leskinen P, Pykalainen J (2001) MCDM methods in strategic planning of forestry on state-owned lands in Finland: applications and experiences. J Multi-Criteria Decision Anal, 257–271 Kangas J, Kangas A, Leskinen P, Pykalainen J (2001) MCDM methods in strategic planning of forestry on state-owned lands in Finland: applications and experiences. J Multi-Criteria Decision Anal, 257–271
45.
go back to reference Saaty TL (1994) Fundamentals of decision making and priority theory with the analytic hierarch process. The analytic hierarch process series, vol VI. RWS, Pittsburgh Saaty TL (1994) Fundamentals of decision making and priority theory with the analytic hierarch process. The analytic hierarch process series, vol VI. RWS, Pittsburgh
46.
go back to reference Daoud MI et al (2008) A high performance algorithm for static task scheduling in heterogeneous distributed computing systems. J Parallel Distrib Comput 68(4):399–409CrossRefMATH Daoud MI et al (2008) A high performance algorithm for static task scheduling in heterogeneous distributed computing systems. J Parallel Distrib Comput 68(4):399–409CrossRefMATH
47.
go back to reference Taylor I, Deelman E, Gannon D, Shields M (2006) Workflows in e-science. Springer, Berlin Taylor I, Deelman E, Gannon D, Shields M (2006) Workflows in e-science. Springer, Berlin
48.
go back to reference Afgan E, Bangalore P, Skala T (2012) Scheduling and planning job execution of loosely coupled applications. J Supercomput 59(3):1431–1454CrossRef Afgan E, Bangalore P, Skala T (2012) Scheduling and planning job execution of loosely coupled applications. J Supercomput 59(3):1431–1454CrossRef
49.
go back to reference Li C, Li LY (2012) Optimal resource provisioning for cloud computing environment. J Supercomput 62(2):989–1022CrossRef Li C, Li LY (2012) Optimal resource provisioning for cloud computing environment. J Supercomput 62(2):989–1022CrossRef
50.
go back to reference Falzon G, Li M (2012) Enhancing genetic algorithms for dependent job scheduling in grid computing environments. J Supercomput 62(1):290–314CrossRef Falzon G, Li M (2012) Enhancing genetic algorithms for dependent job scheduling in grid computing environments. J Supercomput 62(1):290–314CrossRef
51.
go back to reference Luo J, Wu Z, Cao J, Tian T (2012) Dynamic multi-resource advance reservation in grid environment. J Supercomput 60(3):420–436CrossRef Luo J, Wu Z, Cao J, Tian T (2012) Dynamic multi-resource advance reservation in grid environment. J Supercomput 60(3):420–436CrossRef
52.
go back to reference Bradley A, Curran K, Parr G (2006) Discovering resources in computational grid environments. J Supercomput 35(1):27–49CrossRef Bradley A, Curran K, Parr G (2006) Discovering resources in computational grid environments. J Supercomput 35(1):27–49CrossRef
53.
go back to reference Cao J, Spooner DP, Jarvis SA, Nudd GR (2005) Grid load balancing using intelligent agents. Future Gener Comput Syst 21(1):135–149. Special issue on intelligent grid environment: principles and applicationsCrossRef Cao J, Spooner DP, Jarvis SA, Nudd GR (2005) Grid load balancing using intelligent agents. Future Gener Comput Syst 21(1):135–149. Special issue on intelligent grid environment: principles and applicationsCrossRef
Metadata
Title
Bi-level fuzzy based advanced reservation of Cloud workflow applications on distributed Grid resources
Authors
Sahar Adabi
Ali Movaghar
Amir Masoud Rahmani
Publication date
01-01-2014
Publisher
Springer US
Published in
The Journal of Supercomputing / Issue 1/2014
Print ISSN: 0920-8542
Electronic ISSN: 1573-0484
DOI
https://doi.org/10.1007/s11227-013-0994-8

Other articles of this Issue 1/2014

The Journal of Supercomputing 1/2014 Go to the issue

Premium Partner