Skip to main content
SpringerLink
Log in

TC3PoP: a time-cost compromised workflow scheduling heuristic customized for cloud environments

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

Recently, optimizing the monetary cost and performance metrics of executing workflow applications in cloud environments has become an important and interesting research subject. The most critical challenges with the existing methods are simplifying assumptions, which make them far from reality, offering a set of solutions that cannot cover the whole search space and are not real non-dominated solutions, and finally, their high time-complexity. To tackle the mentioned problems, in this paper, a multi-objective workflow scheduling algorithm named Time-Cost Compromised CPoP (TC3PoP) customized for cloud environments is proposed. We have modeled and formulated the workflow scheduling problem based on the cloud environment offers and characteristics. The proposed algorithm is light-weight and based on the offered resources by cloud providers, and produces a set of real Pareto optimal solutions so that a user can freely choose the best solution based on his/her budget and deadline. The results of the experiments show that in terms of HyperVolume indicator, the validity and diversity of TC3PoP solutions are 41.5% and 38.1% better than those of well-known and successful NSGA-II for two real scientific workflows, Montage and LIGO, respectively, and the proposed method is much faster than the compared method. Moreover, to evaluate the quality of Pareto fronts produced by the proposed algorithm, some statistical analysis was made to investigate the precision and distribution of the solutions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8.
Fig. 9.

Similar content being viewed by others

References

  1. Chen, W., Xie, G., Li, R., Li, K.: Execution cost minimization scheduling algorithms for deadline-constrained parallel applications on heterogeneous clouds. Clust. Comput. (2020). https://doi.org/10.1007/s10586-020-03151-w

    Article  Google Scholar 

  2. Iranmanesh, A., Naji, H.R.: DCHG-TS: a deadline-constrained and cost-effective hybrid genetic algorithm for scientific workflow scheduling in cloud computing. Clust. Comput. (2020). https://doi.org/10.1007/s10586-020-03145-8

    Article  Google Scholar 

  3. Masdari, M., ValiKardan, S., Shahi, Z., Azar, S.I.: Towards workflow scheduling in cloud computing: a comprehensive analysis. J. Netw. Comput. Appl. 66, 64–82 (2016)

    Article  Google Scholar 

  4. Alkhanak, E.N., Sai, P.L., Khan, U.S.R.: Cost-aware challenges for workflow scheduling approaches in cloud computing environments: Taxonomy and opportunities. Futur. Gener. Comput. Syst. 50, 3–21 (2015)

    Article  Google Scholar 

  5. Mollajafari, M., Shahhoseini, H.S.: An efficient ACO-based algorithm for scheduling tasks onto dynamically reconfigurable hardware using TSP-likened construction graph. Appl. Intell. (2016). https://doi.org/10.1007/s10489-016-0782-2

    Article  Google Scholar 

  6. Hosseinzadeh, M., Ghafour, M.Y., Hama, H.K., Vo, B., Khoshnevis, A.: Multi-objective task and workflow scheduling approaches in cloud computing: a comprehensive review. J. Grid Comput. (2020). https://doi.org/10.1007/s10723-020-09533-z

    Article  Google Scholar 

  7. Ullman, J.: NP-complete scheduling problems. J. Comput. Syst. Sci. 10(3), 384–393 (1975)

    Article  MathSciNet  Google Scholar 

  8. Peng, Z., Lin, J., Cui, D., Qirui, L., Jieguang, H.: A multi-objective trade-off framework for cloud resource scheduling based on the Deep Q-network algorithm. Clust. Comput. (2020). https://doi.org/10.1007/s10586-019-03042-9

    Article  Google Scholar 

  9. Kumar, A.S., Venkatesan, M.: Task scheduling in a cloud computing environment using HGPSO algorithm. Clust. Comput. 22(1), 2179–2185 (2019)

    Article  Google Scholar 

  10. AWS (Amazon Web Services), http://aws.amazon.com/ec2/pricing/ Visited on 17 Jan 2020.

  11. Madni, S.H.H., Abd Latiff, M.S., Abdulhamid, S.M., Javed, A.: Hybrid gradient descent cuckoo search (HGDCS) algorithm for resource scheduling in IaaS cloud computing environment. Clust. Comput. 22(1), 301–334 (2020)

    Article  Google Scholar 

  12. Rodriguez, S.M., Buyya, R.: Deadline based resource provisioning and scheduling algorithm for scientific workflows on clouds. IEEE Transact. Cloud Comput. 2(2), 222–235 (2014)

    Article  Google Scholar 

  13. Chakravarthi, K.K., Shyamala, L., Vaidehi, V.: Budget aware scheduling algorithm for workflow applications in IaaS clouds. Cluster Comput 1-15, (2020)

  14. Ahmad, W., Alam, B., Ahuja, S., Malik, S.: A dynamic VM provisioning and de-provisioning based cost-efficient deadline-aware scheduling algorithm for Big Data workflow applications in a cloud environment. Clust. Comput. (2020). https://doi.org/10.1007/s10586-020-03100-7

    Article  Google Scholar 

  15. Torkzadeh, S., Soltanizadeh, H., Orouji, A.A.: Energy-aware routing considering load balancing for SDN: a minimum graph-based Ant Colony Optimization. Cluster Comput. 1-20, (2021)

  16. Mollajafari, M., Shahhoseini, H.S.: Cost-optimized ga-based heuristic for scheduling time-constrained workflow applications in infrastructure clouds using an innovative feasibility-assured decoding mechanism. J. Informat Sci Eng. 32(6), 1541–1560 (2016)

    MathSciNet  Google Scholar 

  17. Mboula, J.E.N., Kamla, V.C., Djamegni, C.T.: Cost-time trade-off efficient workflow scheduling in cloud. Simul. Model. Pract. Theory (2020). https://doi.org/10.1016/j.simpat.2020.102107

    Article  Google Scholar 

  18. Mollajafari, M., Shahhoseini, H.S.: A repair-less genetic algorithm for scheduling tasks onto dynamically reconfigurable hardware. Int. Rev. Comp. Softw. 6(2), 206–212 (2011)

    Google Scholar 

  19. Topcuoglu, H., Hariri, S., Wu, M.Y.: Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans. Parallel Distrib. Syst. 13(3), 260–274 (2002)

    Article  Google Scholar 

  20. Jacob, J.C., Katz, D.S., Berriman, G.B., Good, J.C., Laity, A.C., Deelman, E., Kesselman, C., Singh, G., Su, M., Prince, T.A., Williams, R.: Montage: a grid portal and software toolkit for science, grade astronomical image mosaicking. Int. J. Comp. Sci. Eng. 4(2), 73–87 (2009)

    Google Scholar 

  21. Althouse, W.E., Zucker, M.E.: LIGO: the laser interferometer gravitational-wave observatory. Science 256(5055), 325–333 (1992)

    Article  Google Scholar 

  22. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.A.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)

    Article  Google Scholar 

  23. Wang, B., Wang, C., Song, Y., Cao, J., Cui, X., Zhang, L.: A survey and taxonomy on workload scheduling and resource provisioning in hybrid clouds. Cluster Comput, 1-26, (2020)

  24. Garg, S.K., Buyya, R., Siegel, H.J.: Time and cost trade-off management for scheduling parallel applications on utility grids. Futur. Gener. Comput. Syst. 26(8), 1344–1355 (2010)

    Article  Google Scholar 

  25. Wang, P., Lei, Y., Agbedanu, P.R., Zhang, Z.: Makespan-driven workflow scheduling in clouds using immune-based PSO algorithm. IEEE Access 8, 29281–29290 (2020). https://doi.org/10.1109/ACCESS.2020.2972963

    Article  Google Scholar 

  26. Khojasteh, G., Naghibzadeh, M.: A divide and conquer approach to deadline constrained cost-optimization workflow scheduling for the cloud. Clust. Comput. (2021). https://doi.org/10.1007/s10586-020-03223-x

    Article  Google Scholar 

  27. Geng, X., Mao, Y., Xiong, M., Liu, Y.: An improved task scheduling algorithm for scientific workflow in cloud computing environment. Clust. Comput. 22(3), 7539–7548 (2019)

    Article  Google Scholar 

  28. Chakravarthi, K.K., Shyamala, L., Vaidehi, V.: Cost-effective workflow scheduling approach on cloud under deadline constraint using firefly algorithm. Appl. Intell. (2020). https://doi.org/10.1007/s10489-020-01875-1

    Article  Google Scholar 

  29. Zhou, N., Lin, W., Feng, W., Shi, F., Pang, X.: Budget-deadline constrained approach for scientific workflows scheduling in a cloud environment. Clust. Comput. (2020). https://doi.org/10.1007/s10586-020-03176-1

    Article  Google Scholar 

  30. Wu, Z., Liu, X., Ni, Z., Yuan, D., Yang, Y.: A market-oriented hierarchical scheduling strategy in cloud workflow systems. J. Supercomput. 63(1), 256–293 (2013)

    Article  Google Scholar 

  31. Abualigah, L., Diabat, A. : A novel hybrid antlion optimization algorithm for multi-objective task scheduling problems in cloud computing environments. Cluster Comput, 1-19, (2020)

  32. Bessai, K., Youcef, S., Oulamara, A., Godart, C., Nurcan, S.:. Bi-criteria workflow tasks allocation and scheduling in Cloud computing environments. proc. CLOUD. 638-645, (2012)

  33. Alexandru, I., Ostermann, S., Yigitbasi, M., Prodan, R., Fahringer, T., Epema, D.: Performance analysis of cloud computing services for many-tasks scientific computing. IEEE Trans. Parallel Distrib. Syst. 22(6), 931–945 (2010)

    Google Scholar 

  34. Bugingo, E., Zhang, D., Chen, Z., Zheng, W.: Towards decomposition based multi-objective workflow scheduling for big data processing in clouds. Cluster Comput., 1-25, (2020)

  35. Mohammadzadeh, A., Masdari, M., Gharehchopogh, F.S., Jafarian, A.: A hybrid multi-objective metaheuristic optimization algorithm for scientific workflow scheduling. Cluster Comput., 1-25, (2020)

  36. Tejani, G.G., Kumar, S., Gandomi, A.H.: Multi-objective heat transfer search algorithm for truss optimization. Eng. Comp. 37, 641–662 (2021)

    Article  Google Scholar 

  37. Verma, A., Kaushal, S.: A hybrid multi-objective particle swarm optimization for scientific workflow scheduling. Parallel Comput. 62, 1–19 (2017)

    Article  MathSciNet  Google Scholar 

  38. Priya, V., Umamaheswari, K.: Enhanced continuous and discrete multi objective particle swarm optimization for text summarization. Clust. Comput. 22(1), 229–240 (2019)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Automotive Engineering, Iran University of Science and Technology, 16846-13114, Tehran, Iran

    Morteza Mollajafari

  2. Department of Mechanical Engineering, Iran University of Science and Technology, 16846-13114, Tehran, Iran

    Mohammad H. Shojaeefard

Authors
  1. Morteza Mollajafari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohammad H. Shojaeefard
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Morteza Mollajafari.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mollajafari, M., Shojaeefard, M.H. TC3PoP: a time-cost compromised workflow scheduling heuristic customized for cloud environments. Cluster Comput 24, 2639–2656 (2021). https://doi.org/10.1007/s10586-021-03285-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-021-03285-5

Keywords

Search

Navigation