Modified Round Robin with Highest Response Ratio Next CPU Scheduling Algorithm using Dynamic Time Quantum

Authors

  • Suleiman Ebaiya Abubakar Computer Science Department, Ahmadu Bello University, Zaria Nigeria
  • Sahabi Ali Yusuf Computer Science Department, Ahmadu Bello University, Zaria Nigeria
  • Afolabi A. Obiniyi Computer Science Department, Ahmadu Bello University, Zaria Nigeria
  • Abdullahi Mohammed Computer Science Department, Ahmadu Bello University, Zaria Nigeria

Keywords:

CPU Scheduling, Round Robin, Gantt Chart, Time Quantum, Throughput

Abstract

Background: The most popular time-sharing operating systems scheduling technique, whose efficiency heavily dependent on time slice selection, is the round robin CPU scheduling algorithm. The time slice works similar to the First-Come-First-Serve (FCFS) scheduling or processor sharing algorithm if it is large or extremely too small. Some of the existing research papers have an algorithm called Improved Round Robin with Highest Response Ratio Next (IRRHRRN) which made use of response ratio with a predefined time quantum of 10ms with the major aim of avoiding starvation. However, the IRRHRRN algorithm favors processes with shorter burst time than the ones with longer burst time, and gave no regard to the process arrival time, thus leading to starvation. Aim: this study tries to improve on the IRRHRRN algorithm by proposing the Modified Round Robin with Highest Response Ratio Next (MRRHRRN) CPU Scheduling Algorithm using Dynamic Time Quantum in order to reduce the problem of starvation. Method: Dynamic method of determining the time quantum was adopted. Results: The proposed algorithm was compared with four other existing algorisms such as Standard Round Robin (RR), Improved Round Robin (IRR), An Additional Improvement in Round Robin (AAIRR), and the Improved Round Robin with Highest Response Ratio Next (IRRHRRN) and it provided some promising results in terms of the Average Waiting Time of 35407.6 ms, Average Turnaround Time of 36117.6 ms, Average Response Time of 10894.8 ms and Number of Context Switch of 301 for the Non-Zero Arrival Times Processes.

References

Abdulrahim, A., Aliyu, S., Mustapha, A. M. and Abdullahi, S. E. (2014). An Additional Improvement in Round Robin (AAIRR) CPU Scheduling Algorithm. International Journal of Advanced Research in Computer Science and Software Engineering Volume 4, Issue 2, February 2014 ISSN: 2277 128X

Baba’Abu, M. A. (2016). Improved Round Robin with Highest Response Ratio Next (IRRHRRN) CPU Scheduling Algorithm. Master Degree Thesis in Mathematic Department, Faculty of Physical Science, Ahmadu Bello University, Zaria, Kaduna State.

Galvin, P. B., Abraham, S., and Gagne, G. (2004). Operating System Concepts (7th Edition). (B. Zobrist, K. Santor, & M. Lesure, Eds.) NJ, USA: John Wiley and Sons Inc.

Haldar, S. (2009): Operating Systems. Pearson Education, India.

Jerry, B, John, S.C, Barry, L.N and David K. (2005). Discrete-Event System Simulation (Fourth Ed.). Pearson Education International.

MODY, S. & MIRKAR, S. 2019. Smart Round Robin CPU Scheduling Algorithm for Operating Systems. 4th International Conference on Electrical, Electronics, Communication, Computer Technologies and Optimization Techniques (ICEECCOT).

Saeidi, S. and Hakimeh, A. B. (2012). Determining the Optimum Time Quantum Value in Round Robin Process Scheduling Method. International Journal of Information Technology and Computer Science, Vol. 4(10). DOI: IO.5815/ijitcs.2012.10.08

Silberschatz, A., Galvin, P. B., and Gagne, G. (2009). Operating System Concepts, Eighth Edition. Published by: John Wiley & Sons (July 29, 2008).

Simon, A, Dams, G. L., and Danjuma, S (2022). An Improved Half Life Variable Quantum Time with Mean Time Slice Round Robin CPU Scheduling (IMHLVQTRR). Science World Journal Vol. 17(No 2) 2022. ISSN: 1597-6343 (Online), ISSN: 2756-391X (Print). Published by Faculty of Science, Kaduna State University. www.scienceworldjournal.org

Singh, A., Goyal, P., and Batra, S. (2010). An Optimized Round Robin Scheduling Algorithm for CPU Scheduling. International Journal on Computer Science and Engineering (IJCSE) Vol. 02, No. 07, 2010, 2383-23.

SOHRAWORDI, M., ALI, U. A. M. E., UDDIN, M. P. & HOSSAIN, M. M. 2019. A Modified Round Robin CPU Scheduling Algorithm with Dynamic Time Quantum. International Journal of Advanced Research, 7, pp. 422-429.

Srinivasu, N., Balakrishna, A. S. V., and Durgalakshmi, R. (2015). An Augmented Dynamic Round Robin CPU Scheduling Algorithm. Journal of Theoretical and Applied Information Technology, Vol. 76, No 1, pp. 119-124.

Published

2023-03-31