Skip to main content
SpringerLink
Log in

Design of a Scheduling Approach for Budget-Deadline Constrained Applications in Heterogeneous Clouds

  • Conference paper
  • First Online:
Distributed Computing and Internet Technology (ICDCIT 2020)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 11969))

Abstract

The notion of seemingly infinite resources and the dynamic provisioning of these resources on rental premise fascinated the execution of scientific applications in the cloud. The scheduling of the workflows under the utility model is always constrained to some QoS (Quality of Service). Generally, time and cost are considered to be the most important parameters. Scheduling of workflows becomes more challenging when both the time and cost factors are considered simultaneously. Therefore, most of the algorithms have been designed considering either time or cost factor. Hence, to handle the scheduling problem, in this paper, a novel heuristic algorithm named SDBL (Sub-deadline and Budget level) workflow scheduling algorithm for the heterogeneous cloud has been proposed. The proposed methodology effectively utilizes the deadline and budget constrained workflows. The novel strategy of distributing deadline as the level deadline (sub-deadline) to each level of workflow and the mechanism of budget distribution to every individual task satisfies the given constraints and results the exceptional performance of SDBL. SDBL strives to produce a feasible schedule meeting the deadline and the budget constraints. The PSR (Planning Success Rate) is utilized to show the efficiency of the proposed algorithm. For simulation, real workflows were exploited over the methodologies such as SDBL (Sub-deadline and budget level workflow scheduling algorithm), BDSD, BHEFT (Budget Constraint Heterogeneous Earliest Finish Time), and HBCS (Heterogeneous Budget Constrained Scheduling). The comprehensive experimental evaluation demonstrates the effectiveness of the proposed methodology in terms of higher PSR in most cases.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Tsai, W.T., Sun, X., Balasooriya, J.: Service-oriented cloud computing architecture. In: 2010 Seventh International Conference on Information Technology: New Generations, pp. 684–689. IEEE, April 2010

    Google Scholar 

  2. Liu, H., Orban, D.: Gridbatch: cloud computing for large-scale data-intensive batch applications. In: 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (CCGRID), pp. 295–305. IEEE, May 2008

    Google Scholar 

  3. Avram, M.G.: Advantages and challenges of adopting cloud computing from an enterprise perspective. Procedia Technol. 12, 529–534 (2014)

    Article  Google Scholar 

  4. Liu, J., Pacitti, E., Valduriez, P., Mattoso, M.: A survey of data-intensive scientific workflow management. J. Grid Comput. 13(4), 457–493 (2015)

    Article  Google Scholar 

  5. Lin, C., Lu, S.: Scheduling scientific workflows elastically for cloud computing. In: 2011 IEEE 4th International Conference on Cloud Computing, pp. 746–747. IEEE, July 2011

    Google Scholar 

  6. Smanchat, S., Viriyapant, K.: Taxonomies of workflow scheduling problem and techniques in the cloud. Future Gener. Comput. Syst. 52, 1–12 (2015)

    Article  Google Scholar 

  7. Garey, M.R., Johnson, D.S.: A Guide to the Theory of NP-Completeness. Computers and Intractability, pp. 37–79 (1990)

    Google Scholar 

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

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

    Article  Google Scholar 

  10. Broberg, J., Venugopal, S., Buyya, R.: Market-oriented grids and utility computing: the state-of-the-art and future directions. J. Grid Comput. 6(3), 255–276 (2008)

    Article  Google Scholar 

  11. Abrishami, S., Naghibzadeh, M.: Deadline-constrained workflow scheduling in software as a service cloud. Scientia Iranica 19(3), 680–689 (2012)

    Article  Google Scholar 

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

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

  14. Verma, A., Kaushal, S.: Deadline constraint heuristic-based genetic algorithm for workflow scheduling in cloud. Int. J. Grid Util. Comput. 5(2), 96–106 (2014)

    Article  Google Scholar 

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

    Article  Google Scholar 

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

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

    Article  Google Scholar 

  18. Verma, A., Kaushal, S.: Bi-criteria priority based particle swarm optimization workflow scheduling algorithm for cloud. In: Recent Advances in Engineering and Computational Sciences (RAECS), pp. 1–6. IEEE, March 2014

    Google Scholar 

  19. Arabnejad, V., Bubendorfer, K., Ng, B.: Budget and deadline aware e-science workflow scheduling in clouds. IEEE Trans. Parallel Distrib. Syst. 30(1), 29–44 (2019)

    Article  Google Scholar 

  20. Sun, T., Xiao, C., Xu, X.: A scheduling algorithm using sub-deadline for workflow applications under budget and deadline constrained. Cluster Comput. 1–10 (2018)

    Google Scholar 

  21. Arabnejad, H., Barbosa, J.G., Prodan, R.: Low-time complexity budget–deadline constrained workflow scheduling on heterogeneous resources. Future Gener. Comput. Syst. 55, 29–40 (2016)

    Article  Google Scholar 

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

  23. Arabnejad, V., Bubendorfer, K., Ng, B.: Deadline distribution strategies for scientific workflow scheduling in commercial clouds. In: 2016 IEEE/ACM 9th International Conference on Utility and Cloud Computing (UCC), pp. 70–78, December 2016

    Google Scholar 

  24. Yuan, Y., Li, X., Wang, Q., Zhang, Y.: Bottom levelbased heuristic for workflow scheduling in grids. Chin. J. Comput. Chin. Ed. 31(2), 282 (2008)

    Article  Google Scholar 

  25. Yu, J., Buyya, R., Tham, C.K.: Cost-based scheduling of scientific workflow applications on utility grids. In: First International Conference on e-Science and Grid Computing (e-Science 2005), p. 8. IEEE, July 2005

    Google Scholar 

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

    Google Scholar 

  27. Juve, G., Chervenak, A., Deelman, E., Bharathi, S., Mehta, G., Vahi, K.: Characterizing and profiling scientific workflows. Future Gener. Comput. Syst. 29(3), 682–692 (2013)

    Article  Google Scholar 

Download references

Acknowledgment

This research work was supported by 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 research support.

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology (ISM) Dhanbad, Dhanbad, 826004, Jharkhand, 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 .

Editor information

Editors and Affiliations

  1. Vietnam National University, Hanoi, Vietnam

    Dang Van Hung

  2. International Institute of Information Technology, Bangalore, India

    Meenakshi D´Souza

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Rizvi, N., Ramesh, D. (2020). Design of a Scheduling Approach for Budget-Deadline Constrained Applications in Heterogeneous Clouds. In: Hung, D., D´Souza, M. (eds) Distributed Computing and Internet Technology. ICDCIT 2020. Lecture Notes in Computer Science(), vol 11969. Springer, Cham. https://doi.org/10.1007/978-3-030-36987-3_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-36987-3_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-36986-6

  • Online ISBN: 978-3-030-36987-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation