To search, Click below search items.


All Published Papers Search Service


A Survey on Scheduling Algorithms in Real-Time Systems


Wafa Hantom, Alanoud Aldweesh, Reem Alzaher and Atta-ur-Rahman


Vol. 22  No. 4  pp. 686-690


The scheduling algorithm is an essential part of real-time systems, and there are many different scheduling algorithms due to the changing needs and requirements of different real-time systems. The choice of algorithm is critical in any real-time system and is greatly influenced by the type of system such as preemptive or non-preemptive operating systems. Also, the number of the processors (i.e., uniprocessor or multiprocessor) is an essential factor in the choice of the scheduling algorithms. In this paper, we classify scheduling algorithms that are used in Real-time systems into two categories, Uniprocessor scheduling algorithms, and Multiprocessor scheduling algorithms.


Scheduling Algorithms; Real-time Systems; Priority-driven Algorithms; EDF (Earliest Deadline First); RM (Rate Monotonic)