Skip to main content
SpringerLink
Log in

Multi-level parallel scheduling of dependent-tasks using graph-partitioning and hybrid approaches over edge-cloud

  • Application of soft computing
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

An efficient scheduling of dependent-tasks over edge-cloud is the key for achieving better utilization of computational resources and timely completion of interdependent tasks for scientific as well as defence-oriented applications. Many applications comprise several tasks that are dependent in nature and are required to be executed in a specific sequence within a minimum span of time. To handle the execution of such dependent-tasks on distributed computational resources is a challenging problem; as the number of tasks increase, the solution space comprising different task-resource mapping sequences also increase exponentially and it is very difficult to find the near optimal solutions in the search space. In this paper, we focus on two strategies for obtaining optimal solutions for scheduling the multiple dependent-tasks with the specified sequence in a parallel and distributed environment. In the first approach, a hybrid mechanism is proposed to efficiently search the scheduling solution space for multiple dependent tasks. The idea is to first find a schedule by heuristic algorithms and use these as initial solutions in the search space to obtain better solutions using unsupervised machine learning methods. In the second approach, each task-graph is partitioned into different clusters of sub-tasks, where each partitioned cluster is mapped onto the same resource. This strategy reduces the idle times on the resources, wherever possible, in comparison with the first approach. The innovative part of the proposed approaches is to schedule the multiple dependent-tasks in a parallel fashion rather than scheduling in sequential manner. The results show that the schedules obtained by our proposed approaches minimize the total execution time (TET) significantly as compared to other approaches considered in our research study.

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

Similar content being viewed by others

Data availability

Enquiries about data availability should be directed to the authors.

References

  • Ali HS, Rout RR, Parimi P, Das SK (2021) Real-time task scheduling in fog-cloud computing framework for iot applications: a fuzzy logic based approach. In: 2021 Int Conf on Comm Sys NET. (COMSNETS), pp. 556–564. https://doi.org/10.1109/COMSNETS51098.2021.9352931

  • Alkhalaileh M, Calheiros RN, Nguyen QV, Javadi B (2020) Data-intensive application scheduling on mobile edge cloud computing. J Netw Comput Appl. https://doi.org/10.1016/j.jnca.2020.102735

    Article  Google Scholar 

  • Alsurdeh R, Calheiros RN, Matawie KM, Javadi B (2020) Hybrid workflow provisioning and scheduling on edge cloud computing using a gradient descent search approach. In: 2020 19th international symposium on parallel and distributed computing (ISPDC), pp. 68–75 https://doi.org/10.1109/ISPDC51135.2020.00019

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

    Article  Google Scholar 

  • Arunarani A, Manjula D, Sugumaran V (2019) Task scheduling techniques in cloud computing: a literature survey. Fut Gen Comput Syst 91:407–415. https://doi.org/10.1016/j.future.2018.09.014

    Article  Google Scholar 

  • Bogdan PFS, Catalin L, Valentin C (2007) A hybrid algorithm for scheduling workflow applications in grid environments, Lecture Notes Computer. Science 3:1331–1348

  • Brandes U (2001) A faster algorithm for betweenness centrality. J Math Sociol 25(2):163–177

    Article  Google Scholar 

  • Christobel M, Selvi ST, Benedict S (2015) Efficient scheduling of scientific workflows with energy reduction using novel discrete particle swarm optimization and dynamic voltage scaling for computational grids. Sci World J 44–48

  • Garg R, Singh AK (2015) Adaptive work flow scheduling in grid computing based on dynamic resource availability. Eng Sci Technol Int J 18(2):256–269

    Google Scholar 

  • Guevara JC, da Fonseca NLS (2021) Task scheduling in cloud-fog computing systems. Peer-to-Peer Netw Appl 14:962–977. https://doi.org/10.1155/2020/3967847

    Article  Google Scholar 

  • He X, Sun XH, Laszewski GV (2003) Qos guided min-min heuristic for grid task scheduling. J Comput Sci Technol 18(4):442–451

    Article  Google Scholar 

  • John SM, Mohamed MAM (2015) Workflow scheduling algorithm for grid services with hierarchichal grouping based qos. Asian J Appl Sci 1–15

  • Kanemitsu H, Hanada M, Nakazato H (2019) Multiple workflow scheduling with offloading tasks to edge cloud, in. Lecture Notes in Computer Science-CLOUD 11513(2019):1316–1320

  • Kaur M (2016) Elitist multi-objective bacterial foraging evolutionary algorithm for multi-criteria based grid scheduling problem. In: Proceedings of IEEE international conference on internet of things and applications (IOTA), pp 431–436

  • Kaur M (2016) FastPGA based scheduling of dependent tasks in grid computing to provide QoS to Grid users, Proceedings of IEEE Int Conference on Internet of Things and Applications

  • Kaur M, Kadam S (2017) Discovery of resources using madm approaches for parallel and distributed computing. Eng Sci Technol Int J 20(3):1013–1024

    Google Scholar 

  • Kaur M, Kadam S (2018) A novel multi-objective bacteria foraging optimization algorithm (mobfoa) for multi-objective scheduling. Appl Soft Comput 66:183–195. https://doi.org/10.1016/j.asoc.2018.02.011

    Article  Google Scholar 

  • Kaur M, Kadam S (2019) Discovery of resources over cloud using madm approaches. Int J Eng Modell 32(2–4):83–92

    Google Scholar 

  • Kaur M, Kadam S (2021) Bio-inspired workflow scheduling on hpc platforms. Tehnički glasnik 15(1):60–68

    Article  Google Scholar 

  • Mangaraj BB, Jena MR, Mohanty SK (2016) Bacteria foraging algorithm in antenna design. Appl Comput Intell Soft Comput 1–11

  • Moca M, Litan C, Silaghi GC (2016) Multi-criteria and satisfaction oriented scheduling for hybrid distributed computing infrastructures. Fut Gen Comput Syst 55(C):428–443

    Article  Google Scholar 

  • Mohammadi FH, Radu P, Thomas F (2012) A multi-objective approach for workflow scheduling in heterogeneous environments. In: 12th IEEE/ACM Intl. Symposium on cluster, cloud and grid computing (CCGrid), pp 300–309

  • Newman MEJ (2005) A measure of betweeness centrality based on random walks. Soc Netw 27(1):39–54

    Article  Google Scholar 

  • Oo T, Ko Y-B (2019) Application-aware task scheduling in heterogeneous edge cloud. In: International conference on information and communication technology convergence (ICTC), pp 1316–1320. https://doi.org/10.1109/ICTC46691.2019.8939927

  • Passino KM (2002) Biomimicry of bacterial foraging for distributed optimization and control. Control Syst Mag 22:52–67

    Article  Google Scholar 

  • Rahman M, Hassan R, Ranjan R, Buyya R (2013) Adaptive workflow scheduling for dynamic grid and cloud computing environment. Concurr Comput Pract Exp 25(3):1816–1842

    Article  Google Scholar 

  • Resende MGC, Ribeiro CC (2010) Grasp: greedy randomized adaptive search procedures, http://www.research.att.com/export/sites/att_labs/techdocs, (Accessed: Jan 03, 2016)

  • Rodriguez M, Buyya R (2017) A taxonomy and survey on scheduling algorithms for scientific workflows in iaas cloud computing environments. Concurr Comput Pract Exp 29:e4041

    Article  Google Scholar 

  • 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–274

    Article  Google Scholar 

  • Visheratin A, Melnik M, Nasonov D (2016) Workflow scheduling algorithms for hard-deadline constrained cloud environments. Proc Comput Sci 80:2098–2106

    Article  Google Scholar 

  • Wang X, Wang K, Wu S, Di S, Jin H, Yang K, Ou S (2018) Dynamic resource scheduling in mobile edge cloud with cloud radio access network. IEEE Trans Parallel Distrib Syst 29(11):2429–2445. https://doi.org/10.1109/TPDS.2018.2832124

    Article  Google Scholar 

  • Wang S, Li Y, Pang S, Q L, et al (2020) A task scheduling strategy in edge-cloud collaborative scenario based on deadline. Sci Program https://doi.org/10.1155/2020/3967847

Download references

Funding

All authors certify that they have no affiliations with or involvement in any organization or entity with any financial interest or non-financial interest in the subject matter or materials discussed in this manuscript.

Author information

Authors and Affiliations

  1. Department of Computer Science, Savitribai Phule Pune University (SPPU), Pune, India

    Mandeep Kaur

  2. Center for Development of Advanced Computing, SPPU Campus, Ganeshkhind, Pune, India

    Sanjay Kadam

  3. Faculty of Electrical Engineering, Universiti Teknologi MARA, Shah Alam, Malaysia

    Naeem Hannoon

Authors
  1. Mandeep Kaur
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sanjay Kadam
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Naeem Hannoon
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mandeep Kaur.

Ethics declarations

Conflict of interest

The authors have not disclosed any competing interests.

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

Kaur, M., Kadam, S. & Hannoon, N. Multi-level parallel scheduling of dependent-tasks using graph-partitioning and hybrid approaches over edge-cloud. Soft Comput 26, 5347–5362 (2022). https://doi.org/10.1007/s00500-022-07048-1

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-022-07048-1

Keywords

Search

Navigation