Skip to main content
Log in

Priority-based joint EDF–RM scheduling algorithm for individual real-time task on distributed systems

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

Abstract

Multiple tasks arrive in the distributed systems that can be executed in either parallel or sequential manner. Before the execution, tasks are scheduled prioritywise with the help of scheduling algorithms to their respective processors. For task assignment, every scheduling algorithm follows different protocols like upper bound of CPU utilization, assigning priorities, etc. In this paper, author has worked on such scheduling algorithms. Previously, the author evaluated the performance of algorithms on the basis of transactions (group of tasks). In this paper, the author re-evaluates joint EDF–RM scheduling algorithm, where its performance is calculated on the execution of individual task basis. For comparative analysis, similar algorithms are considered, i.e., joint EDF–RMS, earliest deadline first (EDF) and rate monotonic scheduling (RMS). These mentioned algorithms are simulated and analyzed with the help of statistical analysis, and turnaround time of periodic tasks is evaluated. Additionally, migration distribution and CPU utilization on the basis of scheduling algorithms' upper bounds are also calculated.

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.

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

Similar content being viewed by others

References

  1. Suen TTY, Wong JS (1992) Efficient task migration algorithm for distributed systems. IEEE Trans Parallel Distrib Syst 3(4):488–499

    Article  Google Scholar 

  2. Chen JJ, Nelissen G, Huang WH et al (2019) Real-time system. IEEE Int Conf Big Data 55:144. https://doi.org/10.1007/s11241-018-9316-9

    Article  Google Scholar 

  3. Gupta K, Arora VK, Shukla H, Beedu BK, Nagpal A (2019) Dynamic scheduling of distributed storage management tasks using predicted system characteristics, U.S. Patent Application 10/168,953, filed

  4. Coulouris G, Dollimore J, Kindberg T, Blair G (2011) Distributed systems: concepts and design, 5th edn. Addison-Wesley, New York

    MATH  Google Scholar 

  5. Erickson JP, Anderson JH (2019) Soft real-time scheduling. Handbook of real-time computing. Springer, Berlin

    Google Scholar 

  6. Dellabani M, Combaz J, Bensalem S, Bozga M (2019) Local planning semantics: a semantics for distributed real-time systems. Leibniz Trans Embed Syst 6(1):10

    MATH  Google Scholar 

  7. Mall R (2008) Real-time systems: theory and practice. Pearson, New York

    Google Scholar 

  8. Sharma R, Nitin N (2014) Performance evaluation of new joint EDF–RM scheduling algorithm for real time distributed system. J Eng 2014:13

    Google Scholar 

  9. Hammou BA, Lahcen AA, Mouline S (2019) A distributed group recommendation system based on extreme gradient boosting and big data technologies. Appl Intell 59:1–22

    Google Scholar 

  10. Mutlag AA, Ghani MK, Arunkumar NA, Mohammed MA, Mohd O (2019) Enabling technologies for fog computing in healthcare IoT systems. Fut Gener Comput Syst 90:62–78

    Article  Google Scholar 

  11. Bastoni A, Brandenburg B, Anderson J (2010) An empirical comparison of global, partitioned, and clustered multiprocessor EDF schedulers. In: 31st IEEE Real-Time Systems Symposium

  12. Baker TP (2005) A comparison of global and partitioned EDF schedulability tests for multiprocessor. TR-051101

  13. Liu JWS (2003) Real-time systems. Pearson Education, New Delhi

    Google Scholar 

  14. Basu W, Chaudhuri S (2016) A survey of scheduling algorithms in real time systems. Proc IEEE 6(2):553–555

    Google Scholar 

  15. Han JJ, Wang Z, Gong S, Miao T, Yang LT (2019) Resource-aware scheduling for dependable multicore real-time systems: utilization bound and partitioning algorithm. In: IEEE Transactions on Parallel and Distributed Systems

  16. Akram N, Zhang Y, Ali S, Amjad HM (2019) Efficient task allocation for real-time partitioned scheduling on multi-core systems. In: 16th International Bhurban Conference on Applied Sciences and Technology (IBCAST), pp 492–499. IEEE

  17. Blej M, Mostafa A (2019) Task parameter impacts in fuzzy real time scheduling. In: Recent Advances in Intuitionistic Fuzzy Logic Systems, pp 69–78. Springer, Cham

  18. Qian X, Zhong X (2019) Optimal individualized multimedia tourism route planning based on ant colony algorithms and large data hidden mining. Multimed Tools Appl 79:1–10

    Google Scholar 

Download references

Acknowledgements

The author extends their appreciation to the Deanship of Scientific research at Majmaah University for the funding this work under project No. (RGP-2019-26).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nitin Nitin.

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

Sharma, R., Nitin, N., AlShehri, M.A.R. et al. Priority-based joint EDF–RM scheduling algorithm for individual real-time task on distributed systems. J Supercomput 77, 890–908 (2021). https://doi.org/10.1007/s11227-020-03306-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-020-03306-x

Keywords

Navigation