The week's pick
Random Articles
Reseach Article
Comparison of Real Time Task Scheduling Algorithms
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 158 - Number 6 |
| Year of Publication: 2017 |
| Authors: Vijayshree Shinde, Seema C. Biday |
10.5120/ijca2017912832
|
Vijayshree Shinde, Seema C. Biday . Comparison of Real Time Task Scheduling Algorithms. International Journal of Computer Applications. 158, 6 ( Jan 2017), 37-41. DOI=10.5120/ijca2017912832
Abstract
In a Real-Time System, the correctness of the system is not only depending on the logical result of the computation but also on the time at which result is produced is very important. In real time system, scheduling is effected using certain criteria that ensure processes complete their various tasks at a specific time of completion. The quality of real-time scheduling algorithm has a direct impact on real-time system's working. We studied popular scheduling algorithms mainly Earliest Deadline First, Rate Monotonic, Deadline Monotonic, Least laxity First, Group Earliest Deadline First and Group Priority Earliest Deadline First for periodic task. We observe that the choice of a scheduling algorithm is important in designing a real-time system. We conclude by discussing the results of the Real-Time scheduling algorithm survey.
References
- R. L. Panigrahi and M .K. Senapaty, “Real Time System for Software Engineering: An Overview”, Global Journal for Research Analysis, Vol. 3, Issue 1, pp. 25-27, January 2014.
- Jane W.S. Liu, Real-Time Systems , Pearson Education, India,pp. 121 & 26, 2001.
- Mehrin Rouhifar and Reza Ravanmehr, “A Survey on Scheduling Approaches for Hard Real-Time Systems”, International Journal of Computer Applications (0975 – 8887) Volume 131 -No.17, December 2015.
- C. Liu and James Leyland, January 1973, “Scheduling algorithm for multiprogramming in a hard real-time environment”, Journal of the Association for Computing Machinery, 20(1): 46-61.
- J.Leung and J. Whitehead, “On the complexity of fixed-priority schedulings of periodic, real-time tasks”, Performance Evaluation 2(4):237-250 December 1982.
- A.Mok and M.Dertouzos, 1978, “Multiprocessor scheduling in a hard real-time environment”,7th Texas Conference on Computing Systems.
- Ketan Kotecha and Apurva Shah, “Adaptive Scheduling Algorithm for Real-Time Operating System”, 978-1-4244-1823-7/08/$25.00 c_2008 IEEE
- J. Lehoczky, L. Sha and Yv Ding, “The Rate Monotonic Scheduling Algorithm: Exact Characterization And Average Case Behavior”, IEEE International symposium on real time system, pp. 166-171, 1989.
- W. Li, K. Kavi, and R. Akl, “A non-preemptive scheduling algorithm for soft real-time systems”, Computers and Electrical Engineering, vol.33, no. 1, pp. 12–29, 2007.
- Arezou Mohammadi and Selim G. Akl,” Scheduling Algorithms for Real-Time Systems”, Technical Report No. 2005-499, July 15, 2005.
- Zahereel Ishwar Abdul Khalib , Badlishah R. Ahmad and Ong Bi Lynn Ong, “High deadline meeting rate of non-preemptive dynamic soft real time scheduling algorithm”,296301,DOI:10.1109/ICCSCE.2012.648715,2012 IEEE.
- Li, Q. & Ba, W, “A group priority earliest deadline first scheduling algorithm”, Frontiers of Computer Science October 2012, Volume 6, Issue 5, pp 560–567.
Index Terms
Keywords