Advertisement

An Analysis of Scheduling Algorithms in Real-Time Operating System

  • Jayna DongaEmail author
  • M. S. Holia
Conference paper
Part of the Lecture Notes in Networks and Systems book series (LNNS, volume 98)

Abstract

The real-time systems are that in which the correctness of output does not depend only on logical results of the computations, but also on the time at which output is produced. It means that result must be produced within stipulated time. The time constraint in which the system needs to respond is called the deadline. Meeting the deadline is an important parameter in any real time system. The real time operating system helps to real-time applications for meeting its deadline using the mechanism of scheduling. The scheduling technique is the heart of any real-time system which is responsible for making decision about execution order of tasks in the system so any kind of overlapping can be avoided. In this papers, the classification of several scheduling techniques have been done based on different parameters. We have also analyzed different schedulers used for real-time system and comparison between various scheduling techniques have been done. There are various scenarios represented on which further work for improvement can be done.

Keywords

Deadline Laxity Utilization Priority Context switching Schedulability Preemption 

References

  1. 1.
    Lee, J., Shin, K.G.: Preempt a job or not in EDF scheduling of uniprocessor systems. IEEE Trans. Comput. 63(5), 1197–1205 (2014)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Keerthanaa, C., Poongothai, M.,: Improved priority based scheduling algorithm for real time embedded systems. In: IEEE xplore for International Conference on Circuit, Power and Computing Technologies [ICCPCT] (2016)Google Scholar
  3. 3.
    Mottaghi, M.H., Zarandi, H.R.: DFTS: a dynamic fault-tolerant scheduling for real-time tasks in multicore processors. Microprocess. Microsyst. 38, 88–97 (2014)CrossRefGoogle Scholar
  4. 4.
    Kalpana, R., Keerthika, S.: An efficient non-preemptive algorithm for soft real-time systems using domain cluster–group EDF. Int. J. Comput. Appl. 93(20), 0975–8887 (2014)Google Scholar
  5. 5.
    Liu, J.W.S.: Real-Time Systems. Pearson Education, pp. 121–126, India (2001)Google Scholar
  6. 6.
    Liu, J.: Real-Time Systems. Pearson Education (2000)Google Scholar
  7. 7.
    Kotecha, K., Shah, A.: ACO based dynamic scheduling algorithm for real-time operating system. In: Sent to AIPR-2008, Florida (2008)Google Scholar
  8. 8.
    Saini, G.: Application of fuzzy logic to real-time scheduling. In: 14th IEEE-NPSS Real Time Conference (2005)Google Scholar
  9. 9.
    Brucker, P.: Scheduling Algorithms. 5th edn. SpringerGoogle Scholar
  10. 10.
    Buttazzo, G.C.: Hard Real Time Computing Systems: Predictable Scheduling Algorithms and Applications. 3rd edn. Springer (2011)Google Scholar
  11. 11.
    Yoo, M., Gen, M.: Study on scheduling for real- time task by hybrid multiobjective genetic algorithm, Thesis (2006)Google Scholar
  12. 12.
    Stewart, D.B., Khosla, P.: Real-Time Scheduling of Sensor-Based Control Systems (1991)Google Scholar
  13. 13.
    Mohammadi, A., Akl, S.G.: Scheduling algorithms for real-time systems, Technical report No. 499 2005, 15 July 2005Google Scholar
  14. 14.
    Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard real time environment. J. Assoc. Comput. Mach. 20(1), 46–61 (1973)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Gujarat Technological UniversityAhmedabadIndia
  2. 2.BVM Engineering CollegeAnandIndia

Personalised recommendations