Survey on Different Method to Improve Performance of The Round Robin Scheduling Algorithm

Authors

  • Bhavin Fataniya  M.E(I.T) Student, I.T Department, L.D College Of Engineering, Ahmedabad, Gujarat, India
  • Manoj Patel  Assistant Prof., I.T Department, L.D College Of Engineering, Ahmedabad, Gujarat, India

Keywords:

Round Robin,Dynamic Time Quantum.

Abstract

Round Robin (RR) scheduling algorithm is the widely used scheduling algorithm in multitasking and real time environment. Its performance highly depends on a Time Quantum, which is a predefined amount of time assigned by CPU to every task to be executed. If we chose the less time quantum then context switch is high and if we chose the high time quantum then its leads to First-Come-First-Serve (FCFS). So, the performance of the system totally depends upon the choice of optimal time quantum. In this paper I will survey a different method to improve performance of the round robin scheduling algorithm using dynamic time quantum and also compare different method to each other to see the performance of the algorithm with respect to turn around time, waiting time, number of context switch.

References

  1. A. Alsheikhy, R. Ammar, and R. Elfouly, "An improved dynamic Round Robin scheduling algorithm based on a variant quantum time",IEEE, 2015 11th International Computer Engineering Conference (ICENCO), 2015, pp. 98-104.
  2. Rami J. Matarneh,"Self-Adjustment Time Quantum in Round Robin Algorithm Depending on Burst Time of Now Running Processes", American J. of Applied Sciences 6(10): 1831 -1837,2009.
  3. Pandaba Pradhan, Prafulla Ku. Behera and B N B Ray, "Modified Round Robin Algorithm for Resource Allocation in Cloud Computing ", ScienceDirect, Procedia Computer Science 85 ( 2016 ) 878 – 890,2016.
  4. Salman Arif, Saad Rehman and Farhan Riaz "Design of A Modulus Based Round Robin Scheduling Algorithm",IEEE, 9th Malaysian Software Engineering Conference, Dec. 2015
  5. Salman Arif,Naveed Ghaffar,Ali Javed "Implementation of Alternating Median Based Round Robin Scheduling Algorithm",IEEE, International Conference on Computer and Information Technology,2016.
  6. Debashree Nayak, Sanjeev Kumar Malla and   Debashree Debadarshini "Improved Round Robin Scheduling using Dynamic Time Quantum", International Journal of Computer Applications (0975 – 8887) Volume 38– No.5, January 2012
  7. A. Noon,A. Kalakech and S. Kadry,"A New Round Robin Based Scheduling Algorithm for Operating Systems: Dynamic Quantum Using the Mean Average", International Journal of Computer Science Issues (T.TSI),Vol.3,Issue 3,No. 1,pp. 224-229,May 2011.
  8. Amar Ranjan Dash, Sandipta kumar Sahu and Sanjay Kumar Samantra"AN OPTIMIZED ROUND ROBIN CPU SCHEDULING ALGORITHM WITH DYNAMIC TIME QUANTUM" International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol. 5,No.1, February 2015.
  9. Sonia Zauaoui,lotfi Boussaid and Abdellatif Mtibaa, "CPU scheduling algorithms case and comparative study",17th international conference on sciences and techniques of automatic control & computer engineering=STA 2016,sousse,Tunisia,Decmber,2016.
  10. H.S.Behera, R. Mohanty and Debashree Nayak "A New Proposed Dynamic Quantum with Re-Adjusted Round Robin Scheduling Algorithm and Its Performance.
  11. Analysis", International Journal of Computer Applications (0975 – 8887) Volume 5– No.5, August 2010.

International Journal of Scientific Research in Science, Engineering and Technology

Downloads

Published

2018-01-20

Issue

Volume 4, Issue 2, January-February-2018

Section

Research Articles

License

Copyright (c) IJSRSET

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
Bhavin Fataniya, Manoj Patel, " Survey on Different Method to Improve Performance of The Round Robin Scheduling Algorithm, International Journal of Scientific Research in Science, Engineering and Technology(IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 4, Issue 2, pp.69-77, January-February-2018.