Skip to main content
SpringerLink
Log in

Fair budget constrained workflow scheduling approach for heterogeneous clouds

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

The phenomenal advancement of technology paved the way for the execution of complex scientific applications. The emergence of the cloud provides a distributed heterogeneous environment for the execution of large and complex workflows. Due to the dynamic and heterogeneous nature of the cloud, scheduling workflows become a challenging problem. Mapping and assignment of heterogeneous instances for each task while minimizing execution time and cost is a NP-complete problem. For efficient scheduling, it is required to consider various QoS parameters such as time, cost, security, and reliability. Among these, computation time and cost are the two notable parameters. In order to preserve the functionalities of these two parameters in heterogeneous cloud environments, in this paper, a fair budget-constrained workflow scheduling algorithm (FBCWS) is proposed. The novelty of the proposed algorithm is to minimize the makespan while satisfying budget constraints and a fair means of schedule for every task. FBCWS also provides a mechanism to save budget by adjusting the cost-time efficient factor of the minimization problem. The inclusion of a cost-time efficient factor in the algorithm provides flexibility to minimize the makespan or save budget. In order to validate the effectiveness of the proposed approach, several real scientific workflows are simulated, and experimental results are compared with other existing approaches, namely; Heterogeneous Budget Constrained Scheduling (HBCS), Minimizing Schedule Length using Budget Level (MSBL) and Pareto Optimal Scheduling Heuristic (POSH) algorithms. Experimental results prove that the proposed algorithm behaves outstandingly for compute-intensive workflows such as Epigenomic and Sipht. Also, FBCWS outperforms the existing HBCS in most of the cases. Moreover, FBCWS proves to be more time-efficient than POSH and more cost-efficient than MSBL. The effectiveness of the proposed algorithm is illustrated through the popular ANOVA test.

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

Similar content being viewed by others

References

  1. Yu, J., Buyya, R., Ramamohanarao, K.: Workflow scheduling algorithms for grid computing. Metaheuristics for scheduling in distributed computing environments, pp. 173–214. Springer, Berlin (2008)

    Chapter  MATH  Google Scholar 

  2. Yu, J., Buyya, R.: A taxonomy of workflow management systems for grid computing. J. Grid Comput. 3(3–4), 171–200 (2005)

    Article  Google Scholar 

  3. Foster, I., Zhao, Y., Raicu, I., Lu, S.: Cloud computing and grid computing 360-degree compared. Grid Computing Environments Workshop, 2008. GCE'08, pp. 1–10. IEEE, Piscataway (2008)

    Google Scholar 

  4. Buyya, R., Yeo, C.S., Venugopal, S., Broberg, J., Brandic, I.: Cloud computing and emerging IT platforms: vision, hype, and reality for delivering computing as the 5th utility. Future Gener. Comput. Syst. 25(6), 599–616 (2009)

    Article  Google Scholar 

  5. Zhang, Q., Cheng, L., Boutaba, R.: Cloud computing: state-of-the-art and research challenges. J. Internet Serv. Appl. 1(1), 7–18 (2010)

    Article  Google Scholar 

  6. Weinhardt, C., Anandasivam, A., Blau, B., Borissov, N., Meinl, T., Michalk, W., Stößer, J.: Cloud computing: a classification, business models, and research directions. Bus. Inform. Syst. Eng. 1(5), 391–399 (2009)

    Article  Google Scholar 

  7. Juve, G., Deelman, E.: Scientific workflows in the cloud. Grids Clouds and Virtualization, pp. 71–91. Springer, London (2011)

    Chapter  Google Scholar 

  8. Hoffa, C., Mehta, G., Freeman, T., Deelman, E., Keahey, K., Berriman, B., Good, J.: On the use of cloud computing for scientific workflows. IEEE Fourth International Conference on eScience, 2008, eScience'08, pp. 640–645. IEEE, Piscataway (2008)

    Chapter  Google Scholar 

  9. Lewis, H.R.: Review: Garey Michael R. and Johnson David S. Computers and intractability. A guide to the theory of NP-completeness. WH Freeman and Company, San Francisco1979, x+ 338 pp. J. Symbol. Logic. 48(2), 498–500 (1983)

    Article  Google Scholar 

  10. Wu, C., Lin, X., Yu, D., Xu, W., Li, L.: End-to-end delay minimization for scientific workflows inclouds under budget constraint. IEEE Trans. Cloud Comput. 1, 1–1 (2015)

    Google Scholar 

  11. Arabnejad, H., Barbosa, J.G.: A budget constrained scheduling algorithm for workflow applications. J. Grid Comput. 12(4), 665–679 (2014)

    Article  Google Scholar 

  12. Chen, W., Xie, G., Li, R., Bai, Y., Fan, C., Li, K.: Efficient task scheduling for budget constrained parallel applications on heterogeneous cloud computing systems. Future Gener. Comput. Syst. 74, 1–11 (2017)

    Article  Google Scholar 

  13. 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 

  14. Bittencourt, L.F., Madeira, E.R.M.: HCOC: a cost optimization algorithm for workflow scheduling in hybrid clouds. J. Internet Serv. Appl. 2(3), 207–227 (2011)

    Article  Google Scholar 

  15. Su, S., Li, J., Huang, Q., Huang, X., Shuang, K., Wang, J.: Cost-efficient task scheduling for executing large programs in the cloud. Parallel Comput. 39(4–5), 177–188 (2013)

    Article  Google Scholar 

  16. Pandey, S., Wu, L., Guru, S.M., Buyya, R.: A particle swarm optimization-based heuristic for scheduling workflow applications in cloud computing environments. 24th IEEE International Conference on Advanced Information Networking and Applications (AINA), 2010, pp. 400–407. Piscataway, IEEE (2010)

    Google Scholar 

  17. Li, J., Su, S., Cheng, X., Song, M., Ma, L., Wang, J.: Cost-efficient coordinated scheduling for leasing cloud resources on hybrid workloads. Parallel Comput. 44, 1–17 (2015)

    Article  MathSciNet  Google Scholar 

  18. Sakellariou, R., Zhao, H.: A low-cost rescheduling policy for efficient mapping of workflows on grid systems. Sci. Program. 12(4), 253–262 (2004)

    Google Scholar 

  19. Fard, H.M., Prodan, R., Barrionuevo, J.J.D., Fahringer, T.: A multi-objective approach for workflow scheduling in heterogeneous environments. 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid), 2012, pp. 300–309. IEEE, Piscataway (2012)

    Chapter  Google Scholar 

  20. Zhu, Z., Zhang, G., Li, M., Liu, X.: Evolutionary multi-objective workflow scheduling in cloud. IEEE Trans. Parallel Distrib. Syst. 27(5), 1344–1357 (2016)

    Article  Google Scholar 

  21. Durillo, J.J., Prodan, R.: Multi-objective workflow scheduling in Amazon EC2. Clust. Comput. 17(2), 169–189 (2014)

    Article  Google Scholar 

  22. Zhang, F., Cao, J., Li, K., Khan, S.U., Hwang, K.: Multi-objective scheduling of many tasks in cloud platforms. Future Gener. Comput. Syst. 37, 309–320 (2014)

    Article  Google Scholar 

  23. Tan, W., Sun, Y., Li, L.X., Lu, G., Wang, T.: A trust service-oriented scheduling model for workflow applications in cloud computing. IEEE Syst. J. 8(3), 868–878 (2014)

    Article  Google Scholar 

  24. Talukder, A.K.A., Kirley, M., Buyya, R.: Multiobjective differential evolution for scheduling workflow applications on global grids. Concurr. Comput. Pract. Exp. 21(13), 1742–1756 (2009)

    Article  Google Scholar 

  25. Abrishami, S., Naghibzadeh, M., Epema, D.H.: Deadline-constrained workflow scheduling algorithms for infrastructure as a service clouds. Future Gener. Comput. Syst. 29(1), 158–169 (2013)

    Article  Google Scholar 

  26. Ghafouri, R., Movaghar, A., Mohsenzadeh, M.: A budget constrained scheduling algorithm for executing workflow application in infrastructure as a service clouds. Peer Peer Netw. Appl. (2018). https://doi.org/10.1007/s12083-018-0662-0

    Article  Google Scholar 

  27. Arabnejad, V., Bubendorfer, K., Ng, B.: Budget and deadline aware e-science workflow scheduling in clouds. IEEE Trans. Parallel Distrib. Syst. (2018). https://doi.org/10.1007/s10586-018-1751-9

    Article  Google Scholar 

  28. Sun, T., Xiao, C., Xu, X.: A scheduling algorithm using sub-deadline for workflow applications under budget and deadline constrained. Clust. Comput. (2018). https://doi.org/10.1007/s10586-018-1751-9

    Article  Google Scholar 

  29. Yu, J., Buyya, R.: A budget constrained scheduling of workflow applications on utility grids using genetic algorithms. Workshop on Workflows in Support of Large-Scale Science, 2006. WORKS’06, pp. 1–10. IEEE, Piscataway (2006)

    Google Scholar 

  30. Yu, J., Buyya, R.: Scheduling scientific workflow applications with deadline and budget constraints using genetic algorithms. Sci. Program. 14(3–4), 217–230 (2006)

    Google Scholar 

  31. Yuan, Y., Li, X., Wang, Q., Zhu, X.: Deadline division-based heuristic for cost optimization in workflow scheduling. Inf. Sci. 179(15), 2562–2575 (2009)

    Article  MATH  Google Scholar 

  32. Yu, J., Buyya, R., Them, C.K.: Cost-based scheduling of scientific workflow applications on utility grids. First International Conference on e-Science and Grid Computing, 2005, IEEE, Piscataway (2005)

    Google Scholar 

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

    Article  Google Scholar 

  34. Malawski, M., Juve, G., Deelman, E., Nabrzyski, J.: Algorithms for cost-and deadline-constrained provisioning for scientific workflow ensembles in IaaS clouds. Future Gener. Comput. Syst. 48, 1–18 (2015)

    Article  Google Scholar 

  35. Poola, D., Garg, S.K., Buyya, R., Yang, Y., Ramamohanarao, K.: Robust scheduling of scientific workflows with deadline and budget constraints in clouds. IEEE 28th International Conference on Advanced Information Networking and Applications (AINA), 2014, pp. 858–865. Piscataway, IEEE (2014)

    Google Scholar 

  36. Zheng, W., Sakellariou, R.: Budget-deadline constrained workflow planning for admission control. J. Grid Comput. 11(4), 633–651 (2013)

    Article  Google Scholar 

  37. Arabnejad, V., Bubendorfer, K., Ng, B.: Scheduling deadline constrained scientific workflows on dynamically provisioned cloud resources. Future Gener. Comput. Syst. 75, 348–364 (2017)

    Article  Google Scholar 

  38. Calheiros, R.N., Buyya, R.: Meeting deadlines of scientific workflows in public clouds with tasks replication. IEEE Trans. Parallel Distrib. Syst. 25(7), 1787–1796 (2014)

    Article  Google Scholar 

  39. Yang, Y., Liu, K., Chen, J., Liu, X., Yuan, D., Jin, H.: An algorithm in SwinDeW-C for scheduling transaction-intensive cost-constrained cloud workflows. IEEE Fourth International Conference on eScience, 2008, eScience’08, pp. 374–375. IEEE, Piscataway (2008)

    Chapter  Google Scholar 

  40. Rodriguez, M.A., Buyya, R.: Budget-driven scheduling of scientific workflows in IaaS clouds with fine-grained billing periods. ACM Trans. Auton. Adapt. Syst. 12(2), 5 (2017)

    Article  Google Scholar 

  41. Alkhanak, E.N., Lee, S.P., Khan, S.U.R.: Cost-aware challenges for workflow scheduling approaches in cloud computing environments: taxonomy and opportunities. Future Gener. Comput. Syst. 50, 3–21 (2015)

    Article  Google Scholar 

  42. Bharathi, S., Chervenak, A., Deelman, E., Mehta, G., Su, M.H., Vahi, K.: Characterization of scientific workflows. Third Workshop on Workflows in Support of Large-Scale Science, 2008. WORKS 2008, pp. 1–10. IEEE, Piscataway (2008)

    Google Scholar 

Download references

Acknowledgements

This work is supported by the Indian Institute of Technology (ISM), Dhanbad, Govt. of India. The authors wish to express their gratitude and heartiest thanks to the Department of Computer Science & Engineering, Indian Institute of Technology (ISM), Dhanbad, India, for providing their continuous research support.

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology (ISM), Dhanbad, Jharkhand, 826004, India

    Naela Rizvi & Dharavath Ramesh

Authors
  1. Naela Rizvi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dharavath Ramesh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dharavath Ramesh.

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

Rizvi, N., Ramesh, D. Fair budget constrained workflow scheduling approach for heterogeneous clouds. Cluster Comput 23, 3185–3201 (2020). https://doi.org/10.1007/s10586-020-03079-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-020-03079-1

Keywords

Search

Navigation