Developing the Best Scheduling Algorithm From Existing Algorithms for Real Time Operating Systems

This paper is about the selection of the scheduling algorithm for the real-time system. In this paper, we compared different scheduling algorithms and from this comparison, we get another algorithm which is good in performance as compared to the existing one. First, we compare ACO and EDF but both have some merits and demerits. ACO is not good when the system is underloaded, preemptive and single processor while the result of ACO is good in overloaded condition with a lot of execution time. From the comparison of ACO and EDF, another algorithm is developed called an adaptive algorithm which is best in both overloaded and under loaded condition. Then we compared EDF and GA based scheduling algorithm. EDF is used in under loaded condition and when the system becomes overloaded it changes to GA based algorithm. From the comparison of these two algorithms, we get another algorithm which is also called an adaptive algorithm. Performance of both algorithms is measured by using success rate, effective CPU utilization and execution time