Simulation of Priority Round Robin Scheduling Algorithm


  • Tri Dharma Putra Universitas Bhayangkara Jakarta Raya
  • Rakhmat Purnomo Universitas Bhayangkara Jakarta Raya




Context Switching, OS-SIM, Priority Round Robin Scheduling Algorithm, Process Scheduling, Quantum


In this journal, simulation of priority round robin scheduling algorithm is presented. To imitate the processes of operating system operation, simulation can be used. By simulation, model is used, namely models that represent the characteristics or behaviour of systems. Process scheduling is one important operation in operating system. OS-SIM can be used to model and simulate the operations of process scheduling. Some scheduling algorithms are available in modern operating systems, like First come First Serve (FCFS), Shortest Job First (SJF), Round Robin (RR), Priority Scheduling or combination of these algorithms. One important scheduling algorithm for real-time or embedded system is priority round robin scheduling algorithm. Priority round robin scheduling algorithm is a preemptive algorithm. Each process is given time quantum. Each process has a priority. Here time quantum 3 is given. The higher the time quantum, the more the context switching. By the use of OS-SIM, simulation can be understood easily and thoroughly. The statistics, will be calculated automatically by the system by the simulator, like the number of context switching, average waiting time, average turn around time, and average responds time. With one example, by using quantum=3. The average turn around time is 18.25 ms. The Average Waiting Time is 12 ms. The Average Responds time is 2.75 ms. The total burst time is 25 ms.

GS Cited Analysis


Download data is not yet available.


Alexmazinho. (2022). OS-SIM. OS-Simulator.

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.

Dhruv, R. (2019). Round Robin Scheduling Algorithm Based on Dynamic Time Quantum. International Journal of Engineering and Advanced Technology (IJEAT), X(X), 593–595.

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.

Hoger K. Omar, Kamal H. Jihad, S. F. H. (n.d.). Comparative Analysis of the Essential CPU Scheduling Algorithms. Bulletin of Electrical Engineering and Informatics, 10(5), 2742–2750.

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.

m. LaxmiJeevani, T.S.P. Madhuri, Y. S. D. (2018). Improvised Round Robin Scheduling Algorithm and comparison with Existing Round Robin CPU Scheduling Algorithm. IOSR Journal of Computer Engineering, 20(3), 1–4.

Putra, T. D. (2020). Analysis of Preemptive Shortest Job First (SJF) Algorithm in CPU Scheduling. IJARCCE, 9(4), 41–45.

Putra, T. D. (2022). Analysis of Priority Preemptive Scheduling Algorithm: Case Study. Ijarcce, 11(1), 27–30.

Putra, T. D., & Purnomo, R. (2021). Analisis Algoritma Round Robin pada Penjadwalan CPU. Jurnal Ilmiah Teknologi Informasi Asia, 15(2), 85.

Putra, T. D., & Purnomo, R. (2022). Case Study : Improved Round Robin Algorithm. Sinkron : Jurnal Dan Penelitian Teknik Informatika, 7(3), 950–956.

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.

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.

Vinay Kumar Reddy, E., & Aakash, K. (2021). A New Proposal of Smart Time Quantum for Round Robin Algorithm and Comparison with Existing Round Robin Variants. International Research Journal of Engineering and Technology, 1392–1402.

Wikipedia. (2022). Computer Simulation. Wikipedia.


Crossmark Updates

How to Cite

Putra, T. D., & Purnomo, R. (2022). Simulation of Priority Round Robin Scheduling Algorithm. Sinkron : Jurnal Dan Penelitian Teknik Informatika, 7(4), 2170-2181.