Skip to main content

Advertisement

Springer Nature Link
Log in

A novel technique to optimize quality of service for directed acyclic graph (DAG) scheduling in cloud computing environment using heuristic approach

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

At present, the cloud computing environment (CCE) has emerged as one of the significant technologies in communication, computing, and the Internet. It facilitates on-demand services of different types based on pay-per-use access such as platforms, applications and infrastructure. Because of its growing reputation, the massive requests need to be served in an efficient way which gives the researcher a challenging problem known as task scheduling. These requests are handled by method of efficient allocation of resources. In the process of resource allocation, task scheduling is accomplished where there is a dependency between tasks, which is a Directed Acyclic Graph (DAG) scheduling. DAG is one of the most important scheduling due to wide range of its applicable in different areas such as environmental technology, resources, and energy optimization. NP-complete is a renowned concern, so various models deals with NP-complete that have been suggested in the literature. However, as the Quality of Service (QoS)-aware services in the CCEplatform have turned into an attractive and prevalent way to provide computing resources emerges as a novel critical issue. Therefore, the key aim of this manuscript is to develop a novel DAG scheduling model for optimizing the QoS parameters in the CCEplatform and validation of this can be done with the help of extensive simulation technique. Each simulated result is compared with the existing results, and it is found that newly developed algorithm performs better in comparison to the state-of-the-art algorithms.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18

Similar content being viewed by others

Explore related subjects

Discover the latest articles and news from researchers in related subjects, suggested using machine learning.

Availability of data and material

Available on request.

References

  1. Mutlag AA, Abd Ghani MK, Arunkumar N et al (2019) Enabling technologies for fog computing in healthcare IoT systems. Futur Gener Comput Syst 90:62–78. https://doi.org/10.1016/j.future.2018.07.049

    Article  Google Scholar 

  2. Gai K, Guo J, Zhu L, Yu S (2020) Blockchain Meets Cloud Computing: A Survey. IEEE Commun Surv Tutorials 22:2009–2030. https://doi.org/10.1109/COMST.2020.2989392

    Article  Google Scholar 

  3. Malla S, Christensen K (2020) HPC in the cloud: Performance comparison of function as a service (FaaS) vs infrastructure as a service (IaaS). Internet Technol Lett 3:e137. https://doi.org/10.1002/itl2.137

    Article  Google Scholar 

  4. Scheuner J, Leitner P (2020) Function-as-a-Service performance evaluation: A multivocal literature review. J Syst Softw 170:110708. https://doi.org/10.1016/j.jss.2020.110708

    Article  Google Scholar 

  5. Sharma S, Sajid M (2021) Integrated fog and cloud computing: issues and challenges. Int J Cloud Appl Comput (IGI) 11(4), Article 10

  6. Buyya R, Pandey S, Vecchiola C (2009) Cloudbus toolkit for market-oriented cloud computing. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). pp 24–44

  7. Marozzo F (2018) Infrastructures for high-performance computing: Cloud infrastructures. Encycl Bioinforma Comput Biol ABC Bioinforma 1–3:240–246. https://doi.org/10.1016/B978-0-12-809633-8.20374-9

    Article  Google Scholar 

  8. Hammed SS, Arunkumar B (2020) A cost effective‐ secure algorithm for work‐flow scheduling in cloud computing. Internet Technol Lett e233. Doi: https://doi.org/10.1002/itl2.233

  9. Zhou J, Wang T, Cong P et al (2019) Cost and makespan-aware workflow scheduling in hybrid clouds. J Syst Archit 100:101631. https://doi.org/10.1016/j.sysarc.2019.08.004

    Article  Google Scholar 

  10. Sahitya A (2021) Importance of Fog Computing in. Integr Cloud Comput with Internet Things Found Anal Appl, p 211

  11. Song A, Chen W-N, Luo X-N, et al (2020) Scheduling Workflows with Composite Tasks: A Nested Particle Swarm Optimization Approach. IEEE Trans Serv Comput

  12. Jain R, Sharma N (2021) A QoS Aware Binary Salp Swarm Algorithm for Effective Task Scheduling in Cloud Computing. In: Progress in Advanced Computing and Intelligent Engineering. Springer, pp 462–473

  13. Farid M, Latip R, Hussin M, Abdul Hamid NAW (2020) A survey on QoS requirements based on particle swarm optimization scheduling techniques for workflow scheduling in cloud computing. Symmetry (Basel) 12:551

    Article  Google Scholar 

  14. da Silva EC, Gabriel PHR (2020) A Comprehensive Review of Evolutionary Algorithms for Multiprocessor DAG Scheduling. Computation 8:26

    Article  Google Scholar 

  15. Hosseinzadeh M, Ghafour MY, Hama HK, et al (2020) Multi-objective task and workflow scheduling approaches in cloud computing: a comprehensive review. J Grid Comput, pp 1–30

  16. .Li J, Zhang X, Han L et al. (2021) OKCM: improving parallel task scheduling in high-performance computing systems using online learning. J Supercomput 77:5960–5983

  17. Woeginger GJ (2003) Exact algorithms for NP-hard problems: A survey. In: Combinatorial optimization—eureka, you shrink! Springer, pp 185–207

  18. Hanen C (1994) Study of a NP-hard cyclic scheduling problem: The recurrent job-shop. Eur J Oper Res 72:82–101

    Article  MATH  Google Scholar 

  19. Tong Z, Chen H, Deng X et al (2020) A scheduling scheme in the cloud computing environment using deep Q-learning. Inf Sci (Ny) 512:1170–1191

    Article  Google Scholar 

  20. Du J, Leung JY-T (1989) Complexity of scheduling parallel task systems. SIAM J Discret Math 2:473–487

    Article  MathSciNet  MATH  Google Scholar 

  21. Pop F, Dobre C, Cristea V (2008) Performance analysis of grid DAG scheduling algorithms using MONARC simulation tool. In: 2008 International Symposium on Parallel and Distributed Computing, pp 131–138

  22. Bozdag D, Ozguner F, Catalyurek UV (2008) Compaction of schedules and a two-stage approach for duplication-based DAG scheduling. IEEE Trans Parallel Distrib Syst 20:857–871

    Article  Google Scholar 

  23. Kannan R, Karpinski M (2005) Approximation algorithms for NP-hard problems. Oberwolfach Reports 1:1461–1540

    MathSciNet  MATH  Google Scholar 

  24. Hochba DS (1997) Approximation algorithms for NP-hard problems. ACM SIGACT News 28:40–52

    Article  Google Scholar 

  25. Demirci G, Marincic I, Hoffmann H (2018) A divide and conquer algorithm for dag scheduling under power constraints. In: SC18: International Conference for High Performance Computing, Networking, Storage and Analysis, pp 466–477

  26. Epstein L, Tassa T (2006) Optimal preemptive scheduling for general target functions. J Comput Syst Sci 72:132–162

    Article  MathSciNet  MATH  Google Scholar 

  27. Sulaiman M, Halim Z, Waqas M et al (2021) A hybrid list-based task scheduling scheme for heterogeneous computing. J Supercomput 77:10252–10288

    Article  Google Scholar 

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

    Article  Google Scholar 

  29. Li J, Zhang X, Han L et al (2021) OKCM: improving parallel task scheduling in high-performance computing systems using online learning. J Supercomput 77:5960–5983

    Article  Google Scholar 

  30. Ramezani R (2021) Dynamic scheduling of task graphs in multi-FPGA systems using the critical path. J Supercomput 77:597–618

    Article  Google Scholar 

  31. Chowdhary SK, Rao ALN (2021) QoS Enhancement in Cloud-IoT Framework for Educational Institution with Task Allocation and Scheduling with Task-VM Matching Approach. Wireless PersCommun 121:267–286

    Article  Google Scholar 

  32. Medara R, Singh RS (2022) A Review on Energy-Aware Scheduling Techniques for Workflows in IaaS Clouds. Wireless PersCommun. https://doi.org/10.1007/s11277-022-09621-1

    Article  Google Scholar 

  33. Xu Y, Li K, Hu J, Li K (2014) A genetic algorithm for task scheduling on heterogeneous computing systems using multiple priority queues. Inf Sci (Ny) 270:255–287

    Article  MathSciNet  MATH  Google Scholar 

  34. Xu X-J, Xiao C-B, Tian G-Z, Sun T (2016) Hybrid scheduling deadline-constrained multi-DAGs based on reverse HEFT. In: 2016 International Conference on Information System and Artificial Intelligence (ISAI), pp 196–202

  35. Samimi P, Teimouri Y, Mukhtar M (2016) A combinatorial double auction resource allocation model in cloud computing. Inf Sci (Ny) 357:201–216

    Article  MATH  Google Scholar 

  36. Rajak R, Shukla D, Alim A (2018) Modified critical path and top-level attributes (MCPTL)-based task scheduling algorithm in parallel computing. In: Soft Computing: Theories and Applications. Springer, pp 1–13

  37. Rajak R (2018) Deterministic task scheduling method in multiprocessor environment. In: International Conference on Advances in Computing and Data Sciences, pp 331–341

  38. Rajak N, Shukla D, (2019) Performance analysis of workflow scheduling algorithm in cloud computing environment using priority attribute. Int J Adv Sci Technol Australia 28(16):1810 – 1831

  39. Braun TD, Siegel HJ, Beck N et al (2001) A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. J Parallel Distrib Comput 61:810–837

    Article  Google Scholar 

  40. Pop F, Dobre C, Cristea V (2009) Genetic algorithm for DAG scheduling in grid environments. In: 2009 IEEE 5th International Conference on Intelligent Computer Communication and Processing, pp 299–305

  41. Canon L-C, Jeannot E (2009) Evaluation and optimization of the robustness of dag schedules in heterogeneous environments. IEEE Trans Parallel Distrib Syst 21:532–546

    Article  Google Scholar 

  42. Raza Abbas Haidri (2020) ChittaranjanPadmanabhKatti, Prem Chandra Saxena, Cost effective deadline aware scheduling strategy for workflow applications on virtual machines in cloud computing. J King Saud Univ Comput Inf Sci 32(6):666–683

    Google Scholar 

  43. Darbha S, Aggarwal DP (1994) SDBS: A task duplication based optimal scheduling algorithm. In Proceedings of IEEE scalable high performance computing conference, Knoxville, TN, pp 756_61.

  44. Sinnen O Task scheduling for parallel systems. Wiley-Interscience Publication (2007)

  45. Kumar MS, Gupta I (2017) Jana PK Delay-based workflow scheduling for cost optimization in heterogeneous cloud system. In: 2017 Tenth International Conference on Contemporary Computing (IC3), Noida, pp. 1–6

  46. Gupta I, Kumar MS, Jana PK (2018) Efficient workflow scheduling algorithm for cloud computing system: a dynamic priority-based approach. Arab J Sci Eng 43(12):7945–7960

    Article  Google Scholar 

  47. Hwang K (2005) Advanced computer architecture: parallelism,scalability, programmability, 5th reprint. New Delhi:TMH Publishing Company, pp 51_104

  48. Akbar MF, Munir EU, Rafique M M, Malik, Khan SU, Yang LT (2016)zs List-Based Task Scheduling for Cloud Computing. In: IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical And Social Computing (CPSCom) and IEEE Smart Data (SmartData), Chengdu, pp 652–659

  49. Kalra M, Singh S (2015) A review of metaheuristic scheduling techniques in cloud computing. Egypt informatics J 16:275–295

    Article  Google Scholar 

  50. Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms. MIT press

Download references

Funding

None.

Author information

Authors and Affiliations

  1. Department of Computer Science and Applications, Dr. HarisinghGour Central University, Sagar, MP, India

    Ranjit Rajak & Nidhi Rajak

  2. Department of Computer Science, Regional Campus Manipur, Indira Gandhi National Tribal University, Manipur, India

    Shrawan Kumar

  3. Department of Electronics and Communication, University of Allahabad, Prayagraj, UP, India

    Shiv Prakash

  4. King Georges Medical University, Lucknow, UP, India

    Pratibha Dixit

Authors
  1. Ranjit Rajak
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Shrawan Kumar
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Shiv Prakash
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Nidhi Rajak
    View author publications

    You can also search for this author inPubMed Google Scholar

  5. Pratibha Dixit
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Shiv Prakash.

Ethics declarations

Conflict of interest

Authors declares that they have mo conflict of interest.

Additional information

Publisher's Note

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

Rights and permissions

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Rajak, R., Kumar, S., Prakash, S. et al. A novel technique to optimize quality of service for directed acyclic graph (DAG) scheduling in cloud computing environment using heuristic approach. J Supercomput 79, 1956–1979 (2023). https://doi.org/10.1007/s11227-022-04729-4

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-022-04729-4

Keywords