Sr # Articles Date of Authors

Publication
1. Priority based round robin (PBRR) CPU scheduling 2019 Zouaoui, S., Boussaid, L., &
algorithm Mtibaa, A
2. Determining Proficient Time Quantum to Improve the 2019 Biswas, D., & Samsuddoha, M
Performance of Round Robin Scheduling Algorithm
3. Efficient Round Robin Algorithm (ERRA) using the Average 2019 Aijaz, M., Tariq, R., Ghori, M.,
Burst Time Rizvi, S. W., & Qazi, E. F.
4. Smart Round Robin CPU Scheduling Algorithm For 2019 Mody, S., & Mirkar, S.
Operating Systems
5. A novel amended dynamic round robin scheduling 2020 Shafi, U., Shah, M. A., Wahid, A.,
algorithm for timeshared systems. Abbasi, K., Javaid, Q., Asghar, M.,
& Haider, M.
6. Dynamic Round Robin CPU Scheduling Algorithm Based 2020 M Mostafa, S., & Amano, H.
on K-Means Clustering Technique.
7. A Review on the CPU Scheduling Algorithms: Comparative 2021 Shahad M. Ali, Razan F.
Study Alshahrani, Amjad H. Hadadi,
Tahany A. Alghamdi, Fatimah H.
Almuhsin, Enas E. El-Sharawy.
8. A new median-average round Robin scheduling 2022 Sakshi a , Chetan Sharma b ,
algorithm: An optimal approach for reducing turnaround Shamneesh Sharma c , Sandeep
and waiting time Kautish d , Shami A. M. Alsallami e
, E.M. Khalil f , Ali Wagdy
Mohamed g,h, *
9. A New Round Robin Algorithm for Task Scheduling in 2022 Nermeen Ghazy*, Afaf
Real-time System Abdelkader,Mervat S. Zaki,Kamal
A. ElDahshan
10. Improved Round Robin Algorithm 2022 Tri Dharma Putra , Rakhmat
Purnomo

References:

1. Zouaoui, S., Boussaid, L., & Mtibaa, A. (2019). Priority based round robin (PBRR) CPU
scheduling algorithm. International Journal of Electrical & Computer Engineering (2088-
8708), 9(1).Technologies and Optimization (Trends and Future Directions)(ICRITO) (pp.
397-400). IEEE.
2. Biswas, D., & Samsuddoha, M. (2019). Determining Proficient Time Quantum to Improve
the Performance of Round Robin Scheduling Algorithm. International Journal of Modern
Education and Computer Science, 11(10), 33
3. Aijaz, M., Tariq, R., Ghori, M., Rizvi, S. W., & Qazi, E. F. (2019, March). Efficient Round
Robin Algorithm (ERRA) using the Average Burst Time. In 2019 International Conference
on Information Science and Communication Technology (ICISCT) (pp. 1-5). IEEE.
 4. Mody, S., & Mirkar, S. (2019, December). Smart Round Robin CPU Scheduling Algorithm
For Operating Systems. In 2019 4th International Conference on Electrical, Electronics,
Communication, Computer Technologies and Optimization Techniques (ICEECCOT) (pp.
309-316). IEEE.
5. Shafi, U., Shah, M. A., Wahid, A., Abbasi, K., Javaid, Q., Asghar, M., & Haider, M. (2020).
A novel amended dynamic round robin scheduling algorithm for timeshared systems.
Int. Arab J. Inf. Technol., 17(1), 90-98.
6. M Mostafa, S., & Amano, H. (2020). Dynamic Round Robin CPU Scheduling Algorithm
Based on K-Means Clustering Technique. Applied Sciences, 10(15), 5134.
7. Shahad M. Ali, Razan F. Alshahrani, Amjad H. Hadadi, Tahany A. Alghamdi, Fatimah H.
Almuhsin, Enas E. El-Sharawy.(January 2021). A Review on the CPU Scheduling
Algorithms: Comparative Study. IJCSNS International Journal of Computer Science and
Network Security, VOL.21 No.1, January 2021.
8. Sakshi a , Chetan Sharma b , Shamneesh Sharma c , Sandeep Kautish d , Shami A. M.
Alsallami e , E.M. Khalil f , Ali Wagdy Mohamed g,h, *.(2022). A new median-average
round Robin scheduling algorithm: An optimal approach for reducing turnaround and
waiting time. Alexandria Engineering Journal.
9. Nermeen Ghazy*, Afaf Abdelkader,Mervat S. Zaki,Kamal A. ElDahshan.(2022). A New
Round Robin Algorithm for Task Scheduling in Real-time System. International Journal of
Intelligent Engineering and Systems, Vol.15, No.5, 2022.
10. Tri Dharma Putra , Rakhmat Purnomo.(2022). Case Study: Improved Round Robin
Algorithm. This is an Creative Commons License This work is licensed under a Creative
Commons Attribution-NonCommercial 4.0 International License.

Case Study: Improved Round Robin Algorithm

Below is the analysis of the case studies. We discuss three case studies with different quantum, but
with the same processes and burst time. The first with quantum =3, the second with quantum = 4,
the last one is with quantum = 5. Then we discuss the comparison analysis of the three case studies
for evaluation, which one is more efficient than the others.

Turn Around Time of Quantum 3

Process Arrival Burst Time Start Time Finish Time Turn Waiting
Time Around Time
Time
T1 0 10 0 28 28 12
T2 0 14 3 42 42 27
T3 0 9 6 34 34 22
T4 0 12 9 45 45 33
T1 = 0 + ( 16 – 4 ) = 12

T2 = 4 + ( 22 – 8 ) + ( 35 – 26 ) = 27

T3 = 8 + ( 26 – 12 ) = 22

T4 = 12 + ( 31 – 16 ) + ( 41 – 35 ) = 33
It is concluded that for this improved round robin algorithm, the average waiting time is 94/4=23.50
ms.

Turn Around Time of Quantum 4

Process Arrival Burst Start Finish Turn

Time Time Time Time Around
Time
T1 0 10 0 22 22
T2 0 14 4 41 41
T3 0 9 8 31 31
T4 0 12 12 45 45
It is concluded that the average turn around time is = ( 22 + 41 + 31 + 45 ) / 4 = 34.75 ms

Turn Around Time of Quantum 5

Process Arrival Burst Time Start Time Finish Time Turn

Time Around
Time
T1 0 10 0 29 29
T2 0 14 5 38 38
T3 0 9 10 19 19
T4 0 12 19 45 45
T1 = 0 + ( 24 – 5 ) = 19

T2 = 5 + ( 29 – 10 ) = 24

T3 = 10

T4 = 19 + ( 38 – 24 ) = 33

It is concluded that the average turn around time is =(29+38+19+45)/4=32.75 ms

CONCLUSION Based on analysis above, we can conclude that improved round robin algorithm was
more efficient if the quantum is bigger. As we can take a look at the comparison analysis above, that
there is an increase of 50% context switching from quantum 3 to quantum 5. And for average turn
around time we get 13.13% reduction in efficiency. While in average waiting time we get reduction
12.08% efficiency. For future works, the improved round robin algorithm can be modified and
combine with priority scheduling like preemptive or non preemptive shortest job first algorithm.
Other comparisons also can be done, like comparison between intelligent round robin and improved
round robin.
 CPU SCHEDULING ALGORITHMS

4
3.5
3
2.5
2
1.5
1
0.5
0
SJF FCFS RR