Comparison of Earliest Deadline First and Rate Monotonic Scheduling in Polling Server

Abstract

Scheduling is an activity to complete the process on a real-time system. In this project, an analysis aimed to evaluate the scheduling of EDF and RMS algorithms in the case of a polling server. A number of comparisons were made to evaluate which algorithm was better for real-time scheduling as seen from the average of the Turn Around Time (TAT), Waiting Time (WT), and Utilization. From the experiments carried out, EDF produced an average of TAT values at a faster time compared to RMS. In other words, the scheduling of EDF will work faster than RMS. Meanwhile, the utilization value of the two algorithms produced the same results.