Notification: Our email services are now fully restored after a brief, temporary outage caused by a denial-of-service (DoS) attack. If you sent an email on Dec 6 and haven't received a response, please resend your email.
CFP last date
20 December 2024
Reseach Article

Comparison of Real Time Task Scheduling Algorithms

by Vijayshree Shinde, Seema C. Biday
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

@article{ 10.5120/ijca2017912832,
author = { Vijayshree Shinde, Seema C. Biday },
title = { Comparison of Real Time Task Scheduling Algorithms },
journal = { International Journal of Computer Applications },
issue_date = { Jan 2017 },
volume = { 158 },
number = { 6 },
month = { Jan },
year = { 2017 },
issn = { 0975-8887 },
pages = { 37-41 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume158/number6/26916-2017912832/ },
doi = { 10.5120/ijca2017912832 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:04:09.212421+05:30
%A Vijayshree Shinde
%A Seema C. Biday
%T Comparison of Real Time Task Scheduling Algorithms
%J International Journal of Computer Applications
%@ 0975-8887
%V 158
%N 6
%P 37-41
%D 2017
%I Foundation of Computer Science (FCS), NY, USA
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
  1. 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.
  2. Jane W.S. Liu, Real-Time Systems , Pearson Education, India,pp. 121 & 26, 2001.
  3. 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.
  4. 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.
  5. 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.
  6. A.Mok and M.Dertouzos, 1978, “Multiprocessor scheduling in a hard real-time environment”,7th Texas Conference on Computing Systems.
  7. Ketan Kotecha and Apurva Shah, “Adaptive Scheduling Algorithm for Real-Time Operating System”, 978-1-4244-1823-7/08/$25.00 c_2008 IEEE
  8. 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.
  9. 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.
  10. Arezou Mohammadi and Selim G. Akl,” Scheduling Algorithms for Real-Time Systems”, Technical Report No. 2005-499, July 15, 2005.
  11. 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.
  12. 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

Computer Science
Information Sciences

Keywords

Real-Time system Real-Time task scheduling Deadline Execution time Period EDF RM DM GPEDF GEDF LLF.