Skip to main content
Log in

Deadline-Constrained Tasks’ Scheduling in Multi-core Systems Using Harmonic-Aware Load Balancing

  • Research Article-Computer Engineering and Computer Science
  • Published:
Arabian Journal for Science and Engineering Aims and scope Submit manuscript

Abstract

In highly advanced real-time critical applications, the demand of multi-core processing is increasing as the tasks are assigned to cores in the most balanced manner. The balancing of tasks on the cores requires an efficient load balancing algorithm. To balance the loads amongst the cores, all harmonic tasks can be grouped together and shall be assigned on a single core. The concept of harmonic task set is effective as it tends to reach a utilization of one, and thus, the system achieves a higher utilization. The proposed paper is focused on harmonic-aware load balancing algorithm for a set of periodic real-time tasks having constrained deadlines, where the deadline of the tasks is less than the period of the tasks. The extensive analysis was performed to establish the superiority of harmonic task sets in real-time applications. The results of this analysis are reported in this paper. It was observed that by considering the tasks’ harmonic relationship, the proposed load balancing approach greatly improves the feasibility of real-time tasks on a multi-core processor to meet their deadlines.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  1. Vajda, A.: Programming Many-Core Chips. Springer, Berlin (2011)

    Book  Google Scholar 

  2. Langston, J.W.; He, X.: Multi-core Processors and Caching—A Survey. Tennessee Technological University, Cookeville (2007)

    Google Scholar 

  3. Jadon, S.; Yadav, R.S.: Multicore processor: Internal structure, architecture, issues, challenges, scheduling strategies and performance. In: 11th International Conference on Industrial and Information Systems (ICIIS). IEEE, pp. 381–386 (2016)

  4. Kedar, A.S.; Katre, M.; Ramaprasad, H.; Mueller, F.: Policies for migration of real-time tasks in embedded multi-core systems. In: Real Time System Symposium, pp. 17–20 (2009)

  5. Luo, J.; Jha, N.: Power-efficient scheduling for heterogeneous distributed real time embedded systems. In: IEEE Transaction Computer-Aided Design of Integrated Circuits and Systems, pp. 1161–1170 (2007)

  6. Srinivasan, A.; Anderson, J.: Optimal rate-based scheduling on multiprocessors. In: ACM Symposium on Theory of Computing, pp. 189–198 (2002)

  7. Anderson, J.; Srinivasan, A.: Early-release fair scheduling. In: Euromicro Conference on Real-Time Systems, pp. 35–43 (2000)

  8. Anderson, J.H.; Srinivasan, A.: Mixed pfair/erfair scheduling of asynchronous periodic tasks. In: 13th Euromicro Conference in Real-Time Systems. IEEE, pp. 76–85 (2001)

  9. Moir, M.; Ramamurthy, S.: Pfair scheduling of fixed and migrating periodic tasks on multiple resources. In: IEEE Real-Time Systems Symposium, pp. 294–303 (1999)

  10. Baruah, C.P.S.; Cohen, N.; Varvel, D.: A notion of fairness in resource allocation. Proportionate Prog. 15, 600–625 (1996)

    MathSciNet  MATH  Google Scholar 

  11. Baruah, S.: Techniques for multiprocessor global schedulability analysis. In: IEEE Real-Time Systems Symposium, pp. 119–128 (2007)

  12. Andersson, B.: Static-Priority Scheduling on Multiprocessors. Chalmer University of Technology, Goteborg (2003). PhD thesis

    Google Scholar 

  13. Andersson, B.; Jonsson, J.: The utilization bounds of partitioned and pfair static-priority scheduling on multiprocessors are 50%. In: Euromicro Conference on Real-Time Systems. IEEE Computer Society, pp. 33–43 (2003)

  14. March, J.L.; Sahuquillo, J.; Petit, S.; Hassan, H.; Duato, J.: A dynamic power-aware partitioner with task migration for multicore embedded systems. In: Euro-Par 2011 Parallel Processing. Springer, pp. 218–229 (2011)

  15. Wang, H.-C.; Yao, C.-W.: Task migration for energy conservation in real time multi-processor embedded systems. In: International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC), pp. 393–398 (2011)

  16. Kang, J.; Waddington, D.G.: Load balancing aware real-time task partitioning in multicore systems. In: Embedded and Real-Time Computing Systems and Applications (RTCSA), pp. 404–407 (2004)

  17. Afsharpour, S.; Patooghy, A.; Fazeli, M.: Performance/energy aware task migration algorithm for many-core chips. IET Comput. Digit. Tech. 10(4), 165–173 (2016)

    Article  Google Scholar 

  18. Moh, T.-S.; Yun, K.-H.: Application of secretary algorithm to dynamic load balancing in user-space on multicore systems. In: High Performance Computing & Simulation (HPCS). IEEE, pp. 968–977 (2014)

  19. Kuo, T.-W.; Mok, A.: Load adjustment in adaptive real-time systems. In: Real-Time Systems Symposium, pp. 160–170 (1991)

  20. Fan, M.; Quan, G.: Harmonic-aware multi-core scheduling for fixed-priority real-time systems. IEEE Trans. Parallel Distrib. Syst. 25(6), 1476–1488 (2014)

    Article  Google Scholar 

  21. Fan, M.; Rong, R.; Niu, X.: On-line harmonic-aware partitioned scheduling for real-time multi-core systems under RMS. In: Quality Electronic Design. IEEE (2016)

  22. Hassan, H.A.; Salem, S.A.; Mostafa, A.M.; Saad, E.M.: Harmonic segment-based semi-partitioning scheduling on multi-core real-time systems. ACM Trans. Embed. Comput. Syst. 15(4), Article no. 73 (2016)

    Article  Google Scholar 

  23. Wang, T.; Homsi, S.; Niu, L.; Ren, S.; Bai, O.; Quan, G.; Qiu, M.: Harmonicity-aware task partitioning for fixed priority scheduling of probabilistic real-time tasks on multi-core platforms. ACM Trans. Embed. Comput. Syst. 16, 4 (2017)

    Google Scholar 

  24. Wang, T.; Han, Q.; Sha, S.; Wen, W.; Quan, G.; Qiu, M.: On harmonic fixed-priority scheduling of periodic real-time tasks with constrained deadlines. In: 53rd ACM/EDAC/IEEE Design Automation Conference (DAC) (2016)

  25. Stankovic, J.A.; Spuri, M.; Ramamritham, K.; Buttazzo, G.: Deadline scheduling for Real-Time Systems. The Springer International Series in Engineering and Computer. Science 460 (1998)

  26. Blake, G.; Dreslinski, R.G.; Mudge, T.: A survey of multicore processors. IEEE Signal Process. Mag. 26(6), 26–37 (2009)

    Article  Google Scholar 

  27. Ian, I.C.; Tan, K.T.; Hoong, P.K.: Dynamic threshold for imbalance assessment on load balancing for multicore systems. IEEE Trans. 19, 338–348 (2013)

    Google Scholar 

  28. Audsley, N.C.; Burns, A.; Richardson, M.F.; Wellings, A.J.: Hard real-time scheduling: the deadline-monotonic approach. IFAC Proc. Vol. 24(2), 127–132 (1991)

    Article  Google Scholar 

  29. Baker, T.: Multiprocessor EDF and deadline monotonic schedulability analysis. In: 24th IEEE International Real-Time Systems Symposium (2003)

  30. Baker, T.: An analysis of deadline-monotonic schedulability on a multiprocessor. FSU computer science technical report, Department of Computer Science, Florida State University, Tallahassee, Florida. http://www.cs.fsu.edu/research/reports (2003)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shruti Jadon.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jadon, S., Yadav, R.S. Deadline-Constrained Tasks’ Scheduling in Multi-core Systems Using Harmonic-Aware Load Balancing. Arab J Sci Eng 46, 3099–3113 (2021). https://doi.org/10.1007/s13369-020-04980-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13369-020-04980-y

Keywords

Navigation