Skip to main content
SpringerLink
Log in

A Multi-Objective Deadline-Constrained Task Scheduling Algorithm with Guaranteed Performance in Load Balancing on Heterogeneous Networks

  • Original Research
  • Published:
SN Computer Science Aims and scope Submit manuscript

Abstract

Scheduling of complex workflows in heterogeneous distributed computing systems is a challenging task for their management and optimization of a direct or derived set of parametric values. With a heterogeneous environment, processors may have different processing power and associated memory to execute the tasks corresponding to given workflows. The tasks could have requirements of different execution time, dependence among themselves as well as resource constraints. Moreover, workflows are dynamic in nature and they need to be scheduled along with the existing and previously scheduled execution environment. In this paper, workflow scheduling is considered as a multi-objective optimization problem with various constraints and we aim to find a solution for optimizing the load, total cost, and total execution time. We propose a new algorithm CEFT-LB to achieve optimized workflow scheduling while achieving load balancing among the processors. In the task selection phase of our proposed algorithm, we have incorporated necessary modifications to the ranking function of the HEFT algorithm in deciding an Order of Execution (OE) of the tasks. We propose a new algorithm in the processor selection phase for selecting the optimal solutions by considering several factors like: load of the node, total cost, total execution time, utilization of nodes, average response time, minimum queue length, etc. Comparisons with TOPSIS and other state-of-the-art algorithms prove that our proposed algorithm performs better with reference to optimizing the deadline satisfaction rate, the total cost, the total network execution time, and the mean load.

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

Similar content being viewed by others

References

  1. Gary MR, Johnson DS. Computers and intractability: a guide to the theory of NP-completeness. New York: W.H.Freeman and Co.; 1979.

    Google Scholar 

  2. Ullman JD. NP-Complete Scheduling Problems. J Comput Syst Sci. 1975;10(384–393):1975.

    MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  4. Wu M, Gajski D. Hypertool/a programming aid for message passing systems. IEEE Trans Parallel Distrib Syst. 1990;1:330–43.

    Article  Google Scholar 

  5. Kwok Y, Ahmad I. Dynamic critical-path scheduling: an effective technique for allocating task graphs to multinode. IEEE Trans Parallel Distrib Syst. 1996;7(5):506–21.

    Article  Google Scholar 

  6. Boeres C, Filho, Rebello VEF. A cluster-based strategy for scheduling task on heterogeneous nodes. Proc. 16th symp. Computer architecture and high performance computing, pp. 214–221, 2004.

  7. Cirou B, Jeannot E. Triplet: a clustering scheduling algorithm for heterogeneous systems. Proc. Int’l conf. parallel processing workshops, pp. 231–236, 2001.

  8. Arabnejab H, Barbosa JG. List scheduling algorithm for heterogeneous systems by an optimistic cost table. IEEE Trans on Parallel Distrib Syst. 2014;25(3):1.

    Google Scholar 

  9. Wang T, Wei X, Tang C, Fan J. Effcient multi-tasks scheduling algorithm in mobile cloud computing with time constraints. Peer-to-Peer Netw Appl. 2018;11(4):793–807. https://doi.org/10.1007/s12083-017-0561-9.

    Article  Google Scholar 

  10. Shakkeera L, Tamilselvan L. QoS and load balancing aware task scheduling framework for mobile cloud computing environment. Int J Wirel Mob Comput. 2016;10(4):309–16. https://doi.org/10.1504/IJWMC.2016.078201.

    Article  Google Scholar 

  11. Bajaj R, Agrawal D. Improving scheduling of tasks in a heterogeneous environment. IEEE Trans Parallel Distrib Syst. 2004;15(2):107–18.

    Article  Google Scholar 

  12. Armstrong R, Hensgen D, Kidd T. The relative performance of various mapping algorithms is independent of sizable variances in run-time predictions. 7th IEEE heterogeneous computing workshop (HCW’98), pp. 79–87, 1998.

  13. Freund RF, Gherrity M, Ambrosius S, Campbell M, Halderman M, Hensgen D, Keith E, Kidd T, Kussow M, Lima JD, Mirabile F, Moore L, Rust B, Siegel HJ. Scheduling resources in multi-user, heterogeneous, computing environments with SmartNet. In: 7th IEEE heterogeneous computing workshop (HCW’98), pp. 184–199, 1998

  14. Zheng W, Sakellariou R. Budget-deadline constrained work_owplanning for admission control in market-oriented environments. In: Proc.GECON, Paphos, Cyprus, 2012; pp. 105_119

  15. Arabnejad H, Barbosa JG. A budget constrained scheduling algorithm for workflow applications. J Comput. 2014;12(4):665–79. https://doi.org/10.1007/s10723-014-9294-7.

    Article  Google Scholar 

  16. Durillo JJ, Prodan R. Multi-objective workflow scheduling in Amazon EC2. Cluster Comput. 2013;17(2):169–89. https://doi.org/10.1007/s10586-013-0325-0.

    Article  Google Scholar 

  17. Liu L, Fan Q, Buyya R. A deadline-constrained multi-objective task scheduling algorithm in mobile cloud environments. IEEE Access. 2018;6:1.

    Article  Google Scholar 

  18. Samadi Y, Zbakh M, Tadonki C (2018) E-HEFT: enhancement heterogeneous earliest finish time algorithm for task scheduling based on load balancing in cloud computing. HPCS 2018. (The 2018 International Conference on High Performance Computing Simulation), Jul 2018, Orléans, France. pp.601–609. <hal-01820514>

  19. Cai Z, Chen C. Demand-driven task scheduling using 2D chromosome genetic algorithm in mobile cloud. In: Proc. PIC, Shanghai, China. 2014; pp. 539-545

  20. J Liu, Y Mao, J Zhang, KB Letaief (2016) Delay-optimal computation task scheduling for mobile-edge computing systems. In: Proc. ISIT, Barcelona, Spain, 2016, pp. 1451-1455

  21. Wu Z, Ni Z, Gu L, Liu X. A revised discrete particle swarm optimization for cloud workflow scheduling. Computational intelligence and security (CIS), international conference. IEEE. 2010, p. 184–188

  22. Wei X, Fan J, Lu Z, Ding K. Application scheduling in mobile cloud computing with load balancing. J Appl Math. 2013;1:1–13. https://doi.org/10.1155/2013/409539.

    Article  Google Scholar 

  23. Liu L, Zhang M, Buyya R, Fan Q. Deadline-constrained coevolutionary genetic algorithm for scientific workflow scheduling in cloud computing. Pract Exper Concur Comput. 2016. https://doi.org/10.1002/cpe.3942.

    Article  Google Scholar 

  24. (2018). MathWorks. [Online]. Available: http://www.mathworks.com/

  25. Chen W, Deelman E. WorkflowSim: a toolkit for simulating scientific workflows in distributed environments. In E‐Science (e‐Science), IEEE 8th international conference on, IEEE, 2012; 1–8. DOI: 10.1109/ eScience.2012.6404430

  26. Sawant S. A genetic algorithm scheduling approach for virtual machine resources in a cloud computing environment, 2011.

  27. Pandey S, Wu L, Guru SM, Buyya R. A particle swarm optimization based heuristic for scheduling workflow applications in cloud computing environments. In Advanced information networking and applications (AINA), 24th IEEE international conference on, IEEE, 2010; 400–407. DOI: https://doi.org/10.1109/AINA.2010.31.

  28. Balioti V, Tzimopoulos C, Evangelides C. Multi-criteria decision making using TOPSIS method under fuzzy environment. Application in spillway selection “Presented at the 3rd EWaS international conference on “insights on the water-energy-food nexus”, Lefkada Island, Greece, 27–30; 2018

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Aliah University, Newtown, Kolkata, West Bengal, India

    Moumita Chatterjee

  2. Department of Computer Science and Engineering, University of Calcutta, Kolkata, India

    S. K. Setua

Authors
  1. Moumita Chatterjee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. K. Setua
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Moumita Chatterjee.

Ethics declarations

Conflict of Interest

On behalf of all authors, the corresponding author states that there is no 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

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chatterjee, M., Setua, S.K. A Multi-Objective Deadline-Constrained Task Scheduling Algorithm with Guaranteed Performance in Load Balancing on Heterogeneous Networks. SN COMPUT. SCI. 2, 361 (2021). https://doi.org/10.1007/s42979-021-00609-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s42979-021-00609-5

Keywords

Search

Navigation