Simulation and Modelling of Pre-emptive Priority CPU Scheduling Algorithm
DOI:
10.33395/sinkron.v9i3.13352Keywords:
Modelling, OS-SIM, Pre-emptive Priority Scheduling, Simulation, Turnaround Time, Waiting TimeAbstract
A model is a representation of an idea, thing or object in a simplified form. Model contains information about a system that is created with the aim of studying the actual system. Simulation is an imitation of system using a computer model. In this journal simulation is done by using OS-SIM, an operating system simulator. Process scheduling in an important part in operating systems. Several scheduling algorithms exist in the field. Shortest job first, round robin, first come first serve, priority and all of their variants. In this journal discussion about pre-emptive priority scheduling algorithm is presented thoroughly. Pre-emptive priority scheduling algorithm is an algorithm based on priority. The higher the number of the priority, the higher the priority. Five processes are available and given. Each with burst time, priority and different arrival times. Simulation and modelling with OS-SIM are discussed to understand this algorithm more easily. Some statistics numbers in the system are calculated automatically by the OS-SIM. Some screen shot pictures of the simulator are given to describe the model. It is concluded that for these processes the average turnaround time is 42/5 = 8.4 ms and for average waiting time is 28/5=5.6 ms and the total burst time is 14 ms.
Downloads
References
Alexmazinho. (2022). OS-SIM. OS-Simulator.
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.
Kunal Chandiramani, Rishabh Verma, S. M. (2019). A Modified Priority Preemptive Algorithm for CPU Scheduling. International Confierence on Recent Trends in Advanced Computing 2019, ICRTAC 2019, 363–369.
Ledina Hoxha Karteri, A. S. (2015). Preemptive and Non- Preemptive Priority Scheduling. International Journal of Computer Science & Management Studies, 19(01), 1–5.
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. (2022a). 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
Purnomo, R., & Putra, T. D. (2022b). Simulation of Preemptive Shortest Job First Algorithm. IJARCCE, 11(5), 1–11. https://doi.org/10.17148/IJARCCE.2022.11501
Putra, T. D. (2022). Analysis of Priority Preemptive Scheduling Algorithm: Case Study. Ijarcce, 11(1), 27–30. https://doi.org/10.17148/ijarcce.2022.11105
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
Putra, T. D., & Purnomo, R. (2023). Average Max Round Robin Algorithm: A Case Study. Sinkron, 8(3), 1230–1237. https://doi.org/10.33395/sinkron.v8i3.12051
Sakshi, Sharma, C., Sharma, S., Kautish, S., A. M. Alsallami, S., Khalil, E. M., & Wagdy Mohamed, A. (2022). A new median-average round Robin scheduling algorithm: An optimal approach for reducing turnaround and waiting time. Alexandria Engineering Journal, 61(12), 10527–10538. https://doi.org/10.1016/j.aej.2022.04.006
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.
Wikipedia. (2023). Wikipedia. Wikipedia.
Downloads
|
How to Cite
Issue
Section
License
Copyright (c) 2024 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
