Comparative Analysis Of CPU Scheduling Algorithms: Simulation And Its Applications

  • Ali A. AL-Bakhrani, Abdulnaser A. Hagar, Ahmed A. Hamoud, Seema Kawathekar


The main objective of this paper is to compare different type of algorithms like  First-Come, First-Served Scheduling (FCFS), Shortest-Job-First Scheduling (SJF), Priority Scheduling, Round-Robin Scheduling (RR), which helps us to improve the CPU efficiency in real time and time-sharing operating system. Moreover, application of simulation areused for educational purpose. There are many algorithms available for CPU scheduling. But cannotbe implemented in real time operating system because of high context switch rates, large waiting time, large response time, large turnaround time and less throughput.

The proposed algorithms improve all the drawback of simple architecture. The proposed scheduling algorithm solves all the problems encountered in simple scheduling architecture by decreasing the performance parameters to desirable extent and thereby increasing the system throughput.

In this paper, we seek to present the services provided by the simulation program, which can be used in the educational aspect as it facilitates the student to understand the scheduling algorithms within the CPU.

How to Cite
Ahmed A. Hamoud, Seema Kawathekar, A. A. A.-B. A. A. H. (2020). Comparative Analysis Of CPU Scheduling Algorithms: Simulation And Its Applications. International Journal of Advanced Science and Technology, 29(3), 483- 494. Retrieved from