Comparative Study: Preemptive Shortest Job First and Round Robin Algorithms
DOI:
10.33395/sinkron.v8i2.12525Keywords:
comparative study, premptive shortest job first algorithm, round robin algorithm, turn around time, average waiting time, time sliceAbstract
Abstract: Operating system is a software acting as an interface between computer hardware and user. Operating system is known as a resource manager. The main responsibility of operating system is to handle resources of computer system. Scheduling is a key concept in computer multitasking and multiprocessing operating system design by switching the CPU among process. Shortest job first (SJF) and round robin are two wellknown algorithms in CPU processing. For shortest job first, this algorithm can be preemptived. In preemptive shortest job first, when a new process coming in, the process can be interupted. Where with round robin algorithm there will be time slices, context switching, or also called quantum, between process. In this journal we wil discuss comparative study between preemptive shortest job first and round robin algorithms. Three comparative studies will be discussed to understand these two algorithms more deeply. For all comparative study, the average waiting time and average turnaround time is more for round robin algorithm. In the first comparative study, we get average waiting time 52% more. For average turnaround time, 30% more. In second comparative analysis, we get 52 % average waiting time more and we get 35 % average turnaround time more. For third comparative analysis, average waiting time we get 50% more and for average turnaround time, we get 28% more. Thus it is concluded in our comparative study for these kind of data the preemptive shortest job first is more efficient then the round robin algorithm.
Keywords: comparative study, premptive shortest job first algorithm, round robin algorithm, turn around time, average waiting time, time slice
Downloads
References
Abu-Dalbouh, H. M. (2022). A New Combination Approach to CPU Scheduling based on Priority and Round-Robin Algorithms for Assigning a Priority to a Process and Eliminating Starvation. International Journal of Advanced Computer Science and Applications, 13(4), 541–546. https://doi.org/10.14569/IJACSA.2022.0130463
Alhaidari, F., & Balharith, T. Z. (2021). Enhanced round-robin algorithm in the cloud computing environment for optimal task scheduling. Computers, 10(5). https://doi.org/10.3390/computers10050063
Ali, S. M., Alshahrani, R. F., Hadadi, A. H., Alghamdi, T. A., Almuhsin, F. H., & El-Sharawy, E. E. (2021). A Review on the CPU Scheduling Algorithms: Comparative Study. International Journal of Computer Science & Network Security, 21(1), 19–26. https://doi.org/10.22937/IJCSNS.2021.21.1.4
Asma Joshita Trisha, S. B. (2019). A Combined Preemptive SJF and Preemptive Priority Algorithm to Enhance CPU Utilization. International Journal of Computer Applications, 177(19), 26–30.
Chandra Shekar N, K. V. (2017). Analysis of Priority Scheduling Algorithm on the Basis of FCSF & SJF for Similar Priority Jobs. International Journal of Engineering Research in Computer Science and Engineering, 4(3), 73–76.
Freire, D. L., Frantz, R. Z., Roos-frantz, F., & Fernandes, V. B. (2021). New developments in Round Robin algorithms and their applications : a systematic mapping study New developments in Round Robin algorithms and their applications : a systematic mapping study Daniela L . Freire , Rafael Z . Frantz , Fabricia Roos-Frantz Vit. January.
Mostafa, S. M., & Amano, H. (2020). An adjustable variant of round robin algorithm based on clustering technique. Computers, Materials and Continua, 66(3), 3253–3270. https://doi.org/10.32604/cmc.2021.014675
Omar, H. K., Jihad, K. H., & Hussein, S. F. (2021). Comparative analysis of the essential cpu scheduling algorithms. Bulletin of Electrical Engineering and Informatics, 10(5), 2742–2750. https://doi.org/10.11591/eei.v10i5.2812
Purnomo, R., & Putra, T. D. (2022). Comparison Between Simple Round Robin and Improved Round Robin Algorithms. JATISI (Jurnal Teknik Informatika Dan Sistem Informasi), 9(3), 2205–2221. https://doi.org/10.35957/jatisi.v9i3.2547
Putra, T. D. (2020a). Analisis Keranjang Belanja dengan Algoritma Apriori Klasik pada Data Mining. Jurnal Kajian Ilmiah, 20(1). https://doi.org/10.31599/jki.v20i1.70
Putra, T. D. (2020b). Analysis of Preemptive Shortest Job First (SJF) Algorithm in CPU Scheduling. IJARCCE, 9(4), 41–45. https://doi.org/10.17148/ijarcce.2020.9408
Putra, T. D., & Purnomo, R. (2021). Analisis Algoritma Round Robin pada Penjadwalan CPU. Jurnal Ilmiah Teknologi Informasi Asia, 15(2), 85. https://doi.org/10.32815/jitika.v15i2.481
Putra, T. D., & Purnomo, R. (2022a). Case Study : Improved Round Robin Algorithm. Sinkron : Jurnal Dan Penelitian Teknik Informatika, 7(3), 950–956.
Putra, T. D., & Purnomo, R. (2022b). Simulation of Priority Round Robin Scheduling Algorithm. Sinkron, 7(4), 2170–2181. https://doi.org/10.33395/sinkron.v7i4.11665
Shafi, U., Shah, M., Wahid, A., Abbasi, K., Javaid, Q., Asghar, M., & Haider, M. (2020). A novel amended dynamic round robin scheduling algorithm for timeshared systems. International Arab Journal of Information Technology, 17(1), 90–98. https://doi.org/10.34028/iajit/17/1/11
Siahaan, A. P. U. (2016). Comparison Analysis of CPU Scheduling: FCFS, SJF and Round Robin. International Journal of Engineering Development and Research, 4(3), 124–131.
Tri Dharma Putra, A. F. (2021). Comparison Between Simple Round Robin and Intelligent Round Robin Algorithms in CPU Scheduling. International Journal of Advanced Research in Computer and Communication Engineering, 10(4), 86–90.
Downloads
|
How to Cite
Issue
Section
License
Copyright (c) 2023 Rakhmat Purnomo, Tri Dharma Putra
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Muhammad Khoiruddin harahap
Google Scholar 
Moraref
PKP Index
Garuda Kemdikbud
Indonesia OneSearch
OCLC Worldcat
Dimensions
Index Copernicus
Scilit
