Comparative Analysis of Scheduling Algorithms in Real Time Systems
M Gurupriya, Vedha Pranava M, P Lahari, S Sumanjali, Manjunath R D · 2025
In this paper we analyze Earliest Deadline First (EDF) and Rate Monotonic Algorithm (RMA) scheduling of tasks for a real time traffic light system. We implement both scheduling algorithms using Arduino and Tinkercad for simulation, and evaluate their performance according to the values of CPU utilization, idle time, latency, and response time. Results show EDF outperforms RMA in the dynamic task management space, and achieves better CPU utilization and lower latency. RMA gives fixed priorities and has higher response times, whereas EDF is flexible and can organize the task in real time more efficiently. In this paper, we demonstrate that minimization of delays and maximum utilization of resources are required in traffic light control systems and hence ED is the more efficient for controlling time sensitive tasks.