Estimation of CPU Scheduling Algorithms Efficiency Using Object Oriented Programming

9th International Scientific Conference Technics and Informatics in Education – TIE 2022 (2022) стр. 182-188

АУТОР(И): Milica Tufegdžić, Vladeta Jevremović, Zvonko Petrović

Download Full Pdf 

DOI: 10.46793/TIE22.182T


Modern operating systems require sophisticated strategies for computer resources management that allows efficient allocation of Computer Processing Unit (CPU) within minimal response time for active users. CPU allocation shemas use different scheduling algorithms, such as First Come First Served (FCFS), Shortest Job First (SJF), Shortest Remaining Time (SRTF), and Round Robin (RR). These algorithms will be presented and evaluated in the terms of scheduling parameters, such as average waiting time (AWT), average turnaround time (ATT), average reponse time (ART), CPU utilization and throughput. Scheduling criteria metrics is done over two sets of input data, within 20 cases, with five processes in each case. Cases in which processes have the same arrival times (ATs) and cases when processes arrive in different times are considered. Randomly generated ATs and burst times (BTs) are used as input data in executable files, obtained from C++ source codes. Files are running by clicking on proper button from Graphical User Interface (GUI), developed in Python programming language. The results for obtained values of AWT, ATT, ART, CPU utilization and throughput for all cases and for FCFS, SJF, SRTF, and RR algorithms are analyzed and compared with the aim to estimate the efficiency of proposed algorithms.


CPU scheduler; FCFS; SJF; SRTF; RR


  • [1]Silberschatz, A., Gagne, G. & Galvin, P.B.(2018). Operating System Concepts. TenthEdition, Chapter 5, Wiley.
  • [2]Singh, A. (2016). Review and analysis of CPUscheduling algorithms. Biz and Bytes, 7(1),148-152.
  • [3]Goel, N. & Garg, R.B. (2012, November). Acomparative study of CPU schedulingalgorithms. International Journal of Graphics &Image Processing, 2(4), 245-251.
  • [4]Omar, H.K., Kamal H. Jihad,K.H. & Hussein,S.F. (October 2021). Comparative analysis of
    the essential CPU scheduling algorithms. Bulletin of Electrical Engineering and Informatics, 10(5), 2742-2750. doi:10.11591/eei.v10i5.2812
  • [5]Naji A. Majedkan, N., Ahmed, A.J., & Haji, L.M.(2020). CPU scheduling techniques: a reviewon novel approaches strategy andperformance assessment. Journal of AppliedScience and Technology Trends, 01(02), 48 –55.
  • [6]Senan, S. (2017, Temmuz). A neural net-based approach for CPU utilization. Bilişimteknolojileri dergisi, 10(3), 263-272.
  • [7]Arya, G.P., Nilay, K. & Prasad, D. (2018). Animproved round robin CPU schedulingalgorithm based on priority of process.International Journal of Engineering &Technology, 7(4.5), 238-241.
  • [8]Biswarup S. & Arinjay B. (2021). A detailanalysis on AWT and ATT for different CPUscheduling algorithms for different cases.Turkish Journal of Computer and MathematicsEducation, 12(13), 6994-7000
  • [9]Gupta, A.K., Yadav N.S. & and Dinesh Goyal,D.(2017, July). Comparative study of CPUscheduling algorithms. International Journal ofRecent Scientific Research, 8(7), 18851-18854. doi:10.24327/IJRSR
  • [10]Singh, P., Pandey, A. & Mekonnen, A. (2015).Varying response ratio priority: a preemptiveCPU scheduling algorithm (VRRP). Journal ofComputer and Communications, 3, 40-51.doi:10.4236/jcc.2015.34005
  • [11]Chandiramani, K., Verma, R. & Sivagami, M.(2019). A modified priority preemptivealgorithm for CPU scheduling. ProcediaComputer Science, 165, 363–369.
  • [12]Parashar, M. & Amit Chugh, A. (2014, July).Time quantum based CPU schedulingalgorithm. International Journal of ComputerApplications, 98(3), 45-48.
  • [13]Sohrawordi, E.A., Uddin, P. & MahabubHossain, M. (2019). A modified round robinCPU scheduling algorithm with dynamic timequantum. Int. J. Adv. Res., 7(2), 422-429.doi:10.21474/IJAR01/8506
  • [14], accessed 12.06.2022.