Abstract
The earliest deadline first (EDF) and least slack time first (LST) are dynamic schedulers in real-time system. It chooses the priority of the processes grounded on deadline and slack time correspondingly. The process which has the shortest deadline and smallest slack time will have more priority in EDF and LST. EDF and LST are more appropriate for scheduling of process in soft real-time operating system (RTOS). The rate monotonic (RM) and shortest job first (SJF) are static schedulers in real-time system. It chooses the priority of the processes grounded on its occurrence and time required to execute for given process correspondingly. The process which has the smallest period and smallest time required to execute will be considered as more priority in RM and SJF. In this paper, we have implemented the two dynamic scheduling algorithms (EDF and LST) and two static algorithms (RM and SJF) for the soft RTOS. Algorithms are tested with a periodic task set, and results are collected. We have observed the success ratio (SR) and effective CPU utilization (ECU) for all algorithms in a similar environment. It has been observed that the EDF and LST (dynamic algorithms) perform well in underload condition, but in overload situation, they are not able to perform well, whereas the RM and SJF (static algorithms) are failed to schedule a specific process in the underload scenario as well. They perform well in an overload situation compared with static algorithm. Practical investigations have been led on a huge dataset. Dataset consists of the 7000+ process set, and each process set has one to nine processes, and load varies between 0.5 and 5. It has been tried on 500-time unit to approve the rightness everything being equal.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Belagali, R., Kulkarni, S., Hegde, V., Mishra, G.: Implementation and validation of dynamic scheduler based on LST on FreeRTOS. In: Electrical, Electronics, Communication, Computer and Optimization Techniques (ICEECCOT), Mysore, India, Dec 2016, pp. 325–330
Mohammadi, A., Akl, S.G.: Scheduling Algorithms for Real-Time Systems. School of Computing, Queen’s University, Kingston, Ontario (2005)
Thakor, D., Shah, A.: D_EDF: an efficient scheduling algorithm for real-time multiprocessor system. In: Information and Communication Technologies (WICT), Mumbai, India, Dec 2011, pp. 1044–1049
Harkut, D.G.: Comparison of different task scheduling algorithms in RTOS: a survey. Int. J. Adv. Res. Comput. Sci. Softw. Eng. 4(7), 1236–1240 (2014)
Koren, G., Shasha, D.: D_over: an optimal on-line scheduling algorithm for overloaded uniprocessor real-time systems. SIAM J. Comput. 24(2), 318–339 (1995)
Buttazzo, G.C.: Rate monotonic vs. EDF: judgment day. Real-Time Syst. 29(1), 5–26 (2005)
Patel, M., Oza, B.: An improved LLF_DM scheduling algorithm for periodic tasks by reducing context switches. Int. J. Adv. Eng. Res. 2, 248–254 (2015)
Ramamritham, K., Stankovic, J.A., Shiah, P.F.: Efficient scheduling algorithms for real-time multiprocessor systems. IEEE Trans. Parallel Distrib. Syst. 1(2), 184–194 (1990)
Li, W., Kavi, K., Akl, R.: A non-preemptive scheduling algorithm for soft real-time systems. Comput. Electr. Eng. 33(1), 12–29 (2007)
Chen, G., Xie, W.: On a laxity-based real-time scheduling policy for fixed-priority tasks and its non-utilization bound. In: Information Science and Technology (ICIST), Tebessa, Algeria, pp. 7–10 (2011)
Locke, C.D.: Best-effort decision making for real-time scheduling. Ph.D. Thesis, Computer Science Department, CMU (1986)
Shah, A.: Adaptive scheduling algorithm for real-time distributed systems. In: Biologically-Inspired Techniques for Knowledge Discovery and Data Mining, pp. 236–248 (2014)
Shah, A., Kotecha, K.: Scheduling algorithm for real-time operating systems using ACO. In: Computational Intelligence and Communication Networks (CICN), Bhopal, India, Nov 2010, pp. 617–621
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Teraiya, J., Shah, A. (2020). Analysis of Dynamic and Static Scheduling Algorithms in Soft Real-Time System with Its Implementation. In: Pant, M., Sharma, T., Verma, O., Singla, R., Sikander, A. (eds) Soft Computing: Theories and Applications. Advances in Intelligent Systems and Computing, vol 1053. Springer, Singapore. https://doi.org/10.1007/978-981-15-0751-9_69
Download citation
DOI: https://doi.org/10.1007/978-981-15-0751-9_69
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-0750-2
Online ISBN: 978-981-15-0751-9
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)