Skip to main content
Erschienen in: The Journal of Supercomputing 12/2018

13.04.2017

Cloud workflow scheduling with hybrid resource provisioning

verfasst von: Long Chen, Xiaoping Li

Erschienen in: The Journal of Supercomputing | Ausgabe 12/2018

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Resource provisioning strategies are crucial for workflow scheduling problems which are widespread in cloud computing. The main challenge lies in determining the amounts of reserved and on-demand resources to meet users’ requirements. In this paper, we consider the cloud workflow scheduling problem with hybrid resource provisioning to minimize the total renting cost, which is NP-hard and has not been studied yet. An iterative population-based meta-heuristic is developed. According to the shift vectors obtained during the search procedure, timetables are computed quickly. The appropriate amounts of reserved and on-demand resources are determined by an incremental optimization method. The utilization of each resource is balanced in a swaying way, in terms of which the probabilistic matrix is updated for the next iteration. The proposed algorithm is compared with modified existing algorithms for similar problems. Experimental results demonstrate effectiveness and efficiency of the proposed algorithm.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

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!

Literatur
1.
Zurück zum Zitat Abrishami S, Naghibzadeh M, Epema D (2012) Cost-driven scheduling of grid workflows using partial critical paths. IEEE Trans Parallel Distrib Syst 23(8):1400–1414CrossRef Abrishami S, Naghibzadeh M, Epema D (2012) Cost-driven scheduling of grid workflows using partial critical paths. IEEE Trans Parallel Distrib Syst 23(8):1400–1414CrossRef
2.
Zurück zum Zitat Abrishami S, Naghibzadeh M, Epema DH (2013) Deadline-constrained workflow scheduling algorithms for infrastructure as a service clouds. Future Gener Comput Syst 29(1):158–169CrossRef Abrishami S, Naghibzadeh M, Epema DH (2013) Deadline-constrained workflow scheduling algorithms for infrastructure as a service clouds. Future Gener Comput Syst 29(1):158–169CrossRef
4.
Zurück zum Zitat Blythe J, Jain S, Deelman E, Gil Y, Vahi K, Mandal A, Kennedy K (2005). Task scheduling strategies for workflow-based applications in grids. In: IEEE International symposium on cluster computing and the grid (CCGrid 2005), vol 2. IEEE, pp 759–767 Blythe J, Jain S, Deelman E, Gil Y, Vahi K, Mandal A, Kennedy K (2005). Task scheduling strategies for workflow-based applications in grids. In: IEEE International symposium on cluster computing and the grid (CCGrid 2005), vol 2. IEEE, pp 759–767
5.
Zurück zum Zitat Byun EK, Kee YS, Kim JS, Deelman E, Maeng S (2011) BTS: resource capacity estimate for time-targeted science workflows. J Parallel Distrib Comput 71(6):848–862CrossRef Byun EK, Kee YS, Kim JS, Deelman E, Maeng S (2011) BTS: resource capacity estimate for time-targeted science workflows. J Parallel Distrib Comput 71(6):848–862CrossRef
6.
Zurück zum Zitat Byun EK, Kee YS, Kim JS, Maeng S (2011) Cost optimized provisioning of elastic resources for application workflows. Future Gener Comput Syst 27(8):1011–1026CrossRef Byun EK, Kee YS, Kim JS, Maeng S (2011) Cost optimized provisioning of elastic resources for application workflows. Future Gener Comput Syst 27(8):1011–1026CrossRef
8.
Zurück zum Zitat Cai Z, Li X, Gupta JND (2013) Critical path-based iterative heuristic for workflow scheduling in utility and cloud computing. In: Service-Oriented Computing. Springer, pp 207–221 Cai Z, Li X, Gupta JND (2013) Critical path-based iterative heuristic for workflow scheduling in utility and cloud computing. In: Service-Oriented Computing. Springer, pp 207–221
9.
Zurück zum Zitat Chaisiri S, Lee BS, Niyato D (2012) Optimization of resource provisioning cost in cloud computing. IEEE Trans Serv Comput 5(2):164–177CrossRef Chaisiri S, Lee BS, Niyato D (2012) Optimization of resource provisioning cost in cloud computing. IEEE Trans Serv Comput 5(2):164–177CrossRef
10.
Zurück zum Zitat Chen Q, Wang L, Shang Z (2008) Mrgis: a mapreduce-enabled high performance workflow system for GIS. In: IEEE Fourth International Conference on eScience (eScience 2008). IEEE, pp 646–651 Chen Q, Wang L, Shang Z (2008) Mrgis: a mapreduce-enabled high performance workflow system for GIS. In: IEEE Fourth International Conference on eScience (eScience 2008). IEEE, pp 646–651
11.
Zurück zum Zitat Chen WN, Zhang J (2009) An ant colony optimization approach to a grid workflow scheduling problem with various QoS requirements. IEEE Trans Syst Man Cybern C Appl Rev 39(1):29–43CrossRef Chen WN, Zhang J (2009) An ant colony optimization approach to a grid workflow scheduling problem with various QoS requirements. IEEE Trans Syst Man Cybern C Appl Rev 39(1):29–43CrossRef
12.
Zurück zum Zitat Deelman E, Singh G, Su MH, Blythe J, Gil Y, Kesselman C, Mehta G, Vahi K, Berriman GB, Good J et al (2005) Pegasus: a framework for mapping complex scientific workflows onto distributed systems. Sci Program 13(3):219–237 Deelman E, Singh G, Su MH, Blythe J, Gil Y, Kesselman C, Mehta G, Vahi K, Berriman GB, Good J et al (2005) Pegasus: a framework for mapping complex scientific workflows onto distributed systems. Sci Program 13(3):219–237
13.
Zurück zum Zitat Deelman E, Gannon D, Shields M, Taylor I (2009) Workflows and e-science: an overview of workflow system features and capabilities. Future Gener Comput Syst 25(5):528–540CrossRef Deelman E, Gannon D, Shields M, Taylor I (2009) Workflows and e-science: an overview of workflow system features and capabilities. Future Gener Comput Syst 25(5):528–540CrossRef
14.
Zurück zum Zitat Demeulemeester E (1995) Minimizing resource availability costs in time-limited project networks. Manag Sci 41:1590–1598CrossRef Demeulemeester E (1995) Minimizing resource availability costs in time-limited project networks. Manag Sci 41:1590–1598CrossRef
15.
Zurück zum Zitat Demeulemeester E, Herroelen WS (2002) Project scheduling: a research handbook, vol 49. Kluwer Academic Publishers, DordrechtMATH Demeulemeester E, Herroelen WS (2002) Project scheduling: a research handbook, vol 49. Kluwer Academic Publishers, DordrechtMATH
16.
Zurück zum Zitat Demeulemeester E, Herroelen WS, Elmaghraby SE (1996) Optimal procedures for the discrete time/cost trade-off problem in project networks. Eur J Oper Res 88(1):50–68CrossRef Demeulemeester E, Herroelen WS, Elmaghraby SE (1996) Optimal procedures for the discrete time/cost trade-off problem in project networks. Eur J Oper Res 88(1):50–68CrossRef
17.
Zurück zum Zitat Demeulemeester E, De Reyck B, Foubert B, Herroelen WS, Vanhoucke M (1998) New computational results on the discrete time/cost trade-off problem in project networks. J Oper Res Soc 49(11):1153–1163CrossRef Demeulemeester E, De Reyck B, Foubert B, Herroelen WS, Vanhoucke M (1998) New computational results on the discrete time/cost trade-off problem in project networks. J Oper Res Soc 49(11):1153–1163CrossRef
18.
Zurück zum Zitat Hartmann S, Kolisch R (2000) Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem. Eur J Oper Res 127(2):394–407CrossRef Hartmann S, Kolisch R (2000) Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem. Eur J Oper Res 127(2):394–407CrossRef
19.
Zurück zum Zitat Hazır Ö, Haouari M, Erel E (2010) Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version. Comput Oper Res 37(4):649–655CrossRef Hazır Ö, Haouari M, Erel E (2010) Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version. Comput Oper Res 37(4):649–655CrossRef
20.
Zurück zum Zitat Juve G, Deelman E, Vahi K, Mehta G, Berriman B, Berman BP, Maechling P (2009) Scientific workflow applications on amazon EC2. In: 2009 5th IEEE International Conference on E-Science Workshops. IEEE, pp. 59–66 Juve G, Deelman E, Vahi K, Mehta G, Berriman B, Berman BP, Maechling P (2009) Scientific workflow applications on amazon EC2. In: 2009 5th IEEE International Conference on E-Science Workshops. IEEE, pp. 59–66
21.
Zurück zum Zitat Kolisch R, Sprecher A (1997) Psplib-a project scheduling problem library: or software-orsep operations research software exchange program. Eur J Oper Res 96(1):205–216CrossRef Kolisch R, Sprecher A (1997) Psplib-a project scheduling problem library: or software-orsep operations research software exchange program. Eur J Oper Res 96(1):205–216CrossRef
22.
Zurück zum Zitat Mazzucco M, Dumas M (2011) Reserved or on-demand instances? a revenue maximization model for cloud providers. In: IEEE International Conference on Cloud Computing (CLOUD), 2011. IEEE, pp. 428–435 Mazzucco M, Dumas M (2011) Reserved or on-demand instances? a revenue maximization model for cloud providers. In: IEEE International Conference on Cloud Computing (CLOUD), 2011. IEEE, pp. 428–435
23.
Zurück zum Zitat Mohring RH (1984) Minimizing costs of resource requirements in project networks subject to a fixed completion time. Oper Res 32(1):89–120CrossRef Mohring RH (1984) Minimizing costs of resource requirements in project networks subject to a fixed completion time. Oper Res 32(1):89–120CrossRef
24.
Zurück zum Zitat Pelikan M, Goldberg D, Lobo F (2002) A survey of optimization by building and using probabilistic models. Comput Optim Appl 21(1):5–20MathSciNetCrossRef Pelikan M, Goldberg D, Lobo F (2002) A survey of optimization by building and using probabilistic models. Comput Optim Appl 21(1):5–20MathSciNetCrossRef
25.
Zurück zum Zitat Radulescu A, Van Gemund AJ (2001) A low-cost approach towards mixed task and data parallel scheduling. In: International Conference on Parallel Processing (ICPP2001). IEEE, pp. 69–76 Radulescu A, Van Gemund AJ (2001) A low-cost approach towards mixed task and data parallel scheduling. In: International Conference on Parallel Processing (ICPP2001). IEEE, pp. 69–76
26.
Zurück zum Zitat Ranjbar M, Kianfar F, Shadrokh S (2008) Solving the resource availability cost problem in project scheduling by path relinking and genetic algorithm. Appl Math Comput 196:879–888MathSciNetMATH Ranjbar M, Kianfar F, Shadrokh S (2008) Solving the resource availability cost problem in project scheduling by path relinking and genetic algorithm. Appl Math Comput 196:879–888MathSciNetMATH
27.
Zurück zum Zitat Rodrigues SB, Yamashita DS (2010) An exact algorithm for minimizing resource availability costs in project scheduling. Eur J Oper Res 206:562–568MathSciNetCrossRef Rodrigues SB, Yamashita DS (2010) An exact algorithm for minimizing resource availability costs in project scheduling. Eur J Oper Res 206:562–568MathSciNetCrossRef
28.
Zurück zum Zitat Shadrokh S, Kianfar F (2007) A genetic algorithm for resource investment project scheduling problem, tardiness permitted with penalty. Eur J Oper Res 181:86–101MathSciNetCrossRef Shadrokh S, Kianfar F (2007) A genetic algorithm for resource investment project scheduling problem, tardiness permitted with penalty. Eur J Oper Res 181:86–101MathSciNetCrossRef
29.
Zurück zum Zitat Tang S, Yuan J, Wang C, Li XY (2014) A framework for amazon ec2 bidding strategy under sla constraints. IEEE Trans Parallel Distrib Syst 25(1):2–11CrossRef Tang S, Yuan J, Wang C, Li XY (2014) A framework for amazon ec2 bidding strategy under sla constraints. IEEE Trans Parallel Distrib Syst 25(1):2–11CrossRef
30.
Zurück zum Zitat Topcuoglu H, Hariri S, Wu MY (2002) Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans Parallel Distrib Syst 13(3):260–274CrossRef Topcuoglu H, Hariri S, Wu MY (2002) Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans Parallel Distrib Syst 13(3):260–274CrossRef
31.
Zurück zum Zitat Vanhoucke M, Coelho J, Debels D, Maenhout B, Tavares LV (2008) An evaluation of the adequacy of project network generators with systematically sampled networks. Eur J Oper Res 187(2):511–524CrossRef Vanhoucke M, Coelho J, Debels D, Maenhout B, Tavares LV (2008) An evaluation of the adequacy of project network generators with systematically sampled networks. Eur J Oper Res 187(2):511–524CrossRef
32.
Zurück zum Zitat Van den Bossche R, Vanmechelen K, Broeckhove J (2015) Iaas reserved contract procurement optimisation with load prediction. Future Gener Comput Syst 53:13–24CrossRef Van den Bossche R, Vanmechelen K, Broeckhove J (2015) Iaas reserved contract procurement optimisation with load prediction. Future Gener Comput Syst 53:13–24CrossRef
33.
Zurück zum Zitat 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
34.
Zurück zum Zitat Yamashita DS, Armentano VA, Laguna M (2006) Scatter search for project scheduling with resource availability cost. Eur J Oper Res 169:623–637MathSciNetCrossRef Yamashita DS, Armentano VA, Laguna M (2006) Scatter search for project scheduling with resource availability cost. Eur J Oper Res 169:623–637MathSciNetCrossRef
35.
Zurück zum Zitat Yu J, Buyya R (2006) Scheduling scientific workflow applications with deadline and budget constraints using genetic algorithms. Sci Program 14(3):217–230 Yu J, Buyya R (2006) Scheduling scientific workflow applications with deadline and budget constraints using genetic algorithms. Sci Program 14(3):217–230
36.
Zurück zum Zitat Yu J, Buyya R, Tham CK (2005) Cost-based scheduling of scientific workflow applications on utility grids. In: First International Conference on e-Science and Grid Computing (e-Science 2005). IEEE, p 8 Yu J, Buyya R, Tham CK (2005) Cost-based scheduling of scientific workflow applications on utility grids. In: First International Conference on e-Science and Grid Computing (e-Science 2005). IEEE, p 8
37.
Zurück zum Zitat Yuan Y, Li X, Wang Q, Zhu X (2009) Deadline division-based heuristic for cost optimization in workflow scheduling. Inf Sci 179(15):2562–2575CrossRef Yuan Y, Li X, Wang Q, Zhu X (2009) Deadline division-based heuristic for cost optimization in workflow scheduling. Inf Sci 179(15):2562–2575CrossRef
Metadaten
Titel
Cloud workflow scheduling with hybrid resource provisioning
verfasst von
Long Chen
Xiaoping Li
Publikationsdatum
13.04.2017
Verlag
Springer US
Erschienen in
The Journal of Supercomputing / Ausgabe 12/2018
Print ISSN: 0920-8542
Elektronische ISSN: 1573-0484
DOI
https://doi.org/10.1007/s11227-017-2043-5

Weitere Artikel der Ausgabe 12/2018

The Journal of Supercomputing 12/2018 Zur Ausgabe