Skip to main content
SpringerLink
Log in

A New Hybrid Optimization Technique for Scheduling of Periodic and Non-periodic Tasks

  • Original Paper
  • Published:
Augmented Human Research Aims and scope Submit manuscript

Abstract

This article addresses a renowned issue of allocating periodic tasks to a network of heterogeneous processors in distributed computing systems (DCS) subject to timing constraints, tasks precedence, and arbitrary communication among them, in order to lessen the overall busy time whereas guaranteeing the tasks deadlines. A new hybrid optimization (NHO) technique is introduced, a fusion of k-mean clustering (KMC) and Branch-and-Bound (B&B) method for reducing overall normalized busy time (NSBT) of the system. This technique is stationed on B&B method in which each branch grants scheduling solution. K-mean clustering (KMC) technique has been utilized to reduce the complexity of B&B technique by pruning the branches those do not lead feasible solution. A specialized case of non-periodic tasks allocation issue is also studied in this work. The problem is intractable in nature. Finally, a demonstrative example and comparison with some computational experiences are presented. Experimental results reveal that proposed technique achieves better proficiency than other existing techniques in literature. This model is advisable for arbitrary number of processors and tasks.

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. Baker KR, Lawler EL, Kan AHGR (1983) Preempting scheduling of a single machine cost subject to release dates and precedence constraints. Oper Res 31(2)

  2. Bannister JA, Trivedi KS (1983) Task allocation in fault-tolerant distributed system. Acta Inform 20

  3. Kasahara H, Narita S (1984)Practical multiprocessor scheduling algorithms for efficient parallel processing. IEEE Trans Comput 33 (11)

  4. Peng DT, Shin KG (1989) Static allocation of periodic tasks with precedence constraints in distributed real-time system. In: Proceedings of the 9th international conference on distributed computing systems

  5. Peng DT, Shin KG, Abdelzaher TF (1997) Assignment and scheduling communicating periodic tasks in distributed real-time systems. IEEE Trans Softw Eng 23(12)

  6. Ramamritham K, Stankovic JA (1989) Distributed scheduling of tasks with deadlines and resource requirements. IEEE Trans Comput 38(8)

  7. Ramamritham K (1995) Allocation and scheduling of precedence-related periodic tasks. IEEE Trans Paral Distrib Syst 6(4)

  8. Peng DT, Shin KG (1993) Optimal scheduling of cooperative tasks in a distributed systems using an enumerative method. IEEE Trans Softw Eng 19(3)

  9. Sha L, Rajkumar R, Sathaye SS (1994) Generalized rate-monotonic scheduling theory: a framework for developing real-time applications. Proc IEEE 82(1)

  10. Kopiddakis Y, Lamari M, Zissimopoulos V (1997) On the task assignment problem: two new heuristic algorithms. J Paral Distrib Comput 42(1)

  11. Hou CJ, Shin KG (1997) Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems. IEEE Trans Comput 46(12)

  12. Abdelzaher TF, Shin KG (2000) Period-based load partitioning and assignment for large real-time applications. IEEE Trans Comput 49(1)

  13. Anderssont B, Baruaht S, Jonssont J (2001) Static-priority scheduling on multiprocessors. In: Proceedings of the 22nd IEEE real-time systems symposium (RTSS)

  14. Attiya G, Hamam Y (2006) Task allocation for maximizing reliability of distributed systems: a simulating annealing approach. J Paral Distrib Comput 66(10)

  15. Zhu Q, Zeng H, Zheng W, DI Natale M, Sangiovanni-Vincentelli A (2012) Optimization of task allocation and priority assignment in hard real-time distributed systems. ACM Trans Embed Comput Syst 11(4)

  16. Muhuri PK, Rauniyar A, Nath R (2019) On arrival scheduling of real-time precedence constrained tasks on multi-processor systems using genetic algorithm. Fut Gener Comput Syst 93

  17. Davis RI, Burns A (2009) Priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems. In: Proceedings of the 30th IEEE real-time systems symposium

  18. Shehzad MN, Bashir Q, Ahmad G, Anjum A, Awaris MN, Manzoor U, Shaikh ZA, Bolubaid MA, Saba T (2018) Thermal-aware resource allocation in earliest deadline first using fluid scheduling. Distrib Sens Netw 15(3):1–11

    Google Scholar 

  19. Chen J, Du C, Xie F, Lin B (2018) Scheduling non-preemptive tasks with strict periods in multi-core real-time systems. J Syst Archit 90:72–84

    Article  Google Scholar 

  20. Bhat A, Samii S, Rajkumar R (2019) Practical task allocation for software fault-tolerance and its implementation in embedded automotive systems. Real Time Syst 55:889–924

    Article  Google Scholar 

  21. Ma YC, Chen TF, Chung CP (2004) Branch-and-bound task allocation with task clustering-based pruning. J Paral Distrib Comput 64:1223–1240

    Article  Google Scholar 

  22. Niknam T, Amiri B (2010) An efficient hybrid approach based on PSO, ACO and k-means for cluster analysis. Appl Soft Comput 10(1):183–197

    Article  Google Scholar 

  23. Kumar H, Tyagi I (2019) Implementation and comparative analysis of k-means and fuzzy c-means clustering algorithms for tasks allocation in distributed real time system. Int J Embed Real Time Commun Syst 10:66–86

    Article  Google Scholar 

  24. Cai W, Wang Y, Lv R, Jin Q (2019) An efficient location recommendation scheme based on clustering and data fusion. Comput Elect Eng 77:289–299

    Article  Google Scholar 

  25. Kuamr N, Kumar H, Sharma K (2020) Extension of FCM by introducing new distance metric. SN Appl Sci 2

  26. Kumar H, Tyagi I (2020) Hybrid model for tasks scheduling in distributed real time system. J Ambient Intel Hum Comput. https://doi.org/10.1007/s12652-020-02445-6

    Article  Google Scholar 

  27. Auluck N, Agrawal DP A scalable task duplication based algorithm for improving the schedulability of real-time heterogeneous multiprocessor system. In: Proceeding of the 2003 international conference on parallel processing workshops

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

    Article  MathSciNet  Google Scholar 

  29. Keshanchi B, Navimipour NJ (2016) Priority-based task scheduling in the cloud systems using a memetic algorithm. J Circuits Syst Comput 25

  30. Ramamritham K (1990) Allocation and scheduling of complex periodic tasks. In: Proceedings of the 10th international conference on distributed computing systems

  31. Thanikesavan S, Killat U Static scheduling of periodic tasks in a decentralized real-time control system using an ILP. In: Proceedings of the 2005 11th international conference on parallel and distributed system

  32. Monnier Y, Beauvais JP, Deplanche AM (1998) A genetic algorithm for scheduling tasks in a real-time distributed system. In: Proceedings 24th EUROMICRO conference (Cat No. 98EX204)

  33. Thanikesavan S, Killat U (2004) Global scheduling of periodic tasks in a decentralized real-time control system. In: Proceedings in IEEE international workshop on factory communication system

  34. Lo VM (1988) Heuristic algorithms for task assignment in distributed system. IEEE Trans Comput 37(11)

  35. Shatz SM, Wang JP, Goto M (1992) Task allocation for maximizing reliability of distributed computer systems. IEEE Trans Comput 41(9)

  36. Sarje AK, Sagar AK (1991) Heuristic model for task allocation in distributed computer systems. IEEE Proc E Comput Dig Tech 138(5):313–318

    Article  Google Scholar 

  37. Topcuoglu H, Hariri S, Wu MY (2002) Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans Paral Distrib Comput 13(3):260–274

    Article  Google Scholar 

  38. Daoud MI, Kharma N (2008) A high performance algorithm for static task scheduling in heterogeneous distributed real time systems. J Paral Distrib Comput 63(4)

  39. Kartik S, Murthy CSR (1997) Task allocation for maximizing reliability of distributed computing system. IEEE Trans Comput 46(6):719–724

    Article  Google Scholar 

  40. Yadav PK, Singh MP, Kumar A, Agarwal B (2011) An efficient tasks scheduling model in distributed processing systems using ANN. Int J Circ Syst 1:1–2

    Google Scholar 

  41. Yadav PK, Pradhan P, Singh PP (2012) A fuzzy clustering method to minimize the inter task communication effect for optimal utilization of processor’s capacity in distributed real time system. In: Proceedings of the international conference on soft computing for problem solving, p 130

  42. Akbari M, Rashidi H (2016) A multi-objectives scheduling algorithm based on cuckoo optimization for task allocation problem at compile time in heterogeneous systems. Exp Syst Appl 60

  43. Kumar H, Chauhan NK, Yadav PK (2019) Hybrid genetic algorithm for task scheduling in distributed real-time system. Int J Syst Control Commun 10(1)

  44. Elsadek AA, Wells BE (1999) A heuristic model for task allocation in heterogeneous distributed computing system. Int J Comput App 6(1):0–35

  45. Kumar H, Chauhan NK, Yadav PK (2018) A high performance model for task allocation in distributed computing system using K-means clustering technique. Int J Distrib Syst Tech 9(3):1–23

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, Gurukula Kangri (Deemed to be University), Haridwar, Uttarakhand, 249404, India

    Harendra Kumar & Isha Tyagi

Authors
  1. Harendra Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Isha Tyagi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Harendra Kumar.

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

Kumar, H., Tyagi, I. A New Hybrid Optimization Technique for Scheduling of Periodic and Non-periodic Tasks. Augment Hum Res 6, 11 (2021). https://doi.org/10.1007/s41133-021-00049-z

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s41133-021-00049-z

Keywords

Search

Navigation