Improvisation of Round Robin Algorithm

Aishna Gupta; Patil Darshan Rajkumar

doi:10.55524/

Authors

Aishna Gupta Student, Department of Computer Science and Engineering. Vellore Institute of Technology, Vellore, India Author
Patil Darshan Rajkumar Student, Department of Computer Science and Engineering. Vellore Institute of Technology, Vellore, India Author

DOI:

https://doi.org/10.55524/

Keywords:

Round Robin, Cent OS, Waiting Time, Time Quantum, Turnaround Time

Abstract

We are trying to improvise the existing Round Robin Algorithm and test its performance across host OS and VM as well. We would be testing the performance of the improvised algorithm on the Cent OS running on Virtual Box.. We have worked on the scheduling algorithm specifically Round Robin Scheduling in our lab classes. Basically, we will be finding out the best way to properly select the “Time Quantum” so as to get Minimum ‘Waiting Time’ and ‘Turnaround Time’.After looking into so many research papers, we have found that, by sorting the processes in increasing order of their burst time and taking median of all the burst time, we can minimize the waiting and turnaround time.

Downloads

Download data is not yet available.

References

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.

H.S. Behera, Rakesh Mohanty, Debashree Nayak. A New Proposed Dynamic Quantum with Re-Adjusted Round Robin Scheduling Algorithm and Its Performance Analysis , International Journal of Computer Applications, Vol. 5, no. 5, August 2010.

Helmy, T. and A. Dekdouk, 2007. Burst Round Robin as a Proportional-share Scheduling Algorithm, IEEEGCC, http://eprints.kfupm.edu.sa/1462.

Pallab banerjee, probal banerjee, shweta sonali dhal. Comparative Performance Analysis of Average Max Round Robin Scheduling Algorithm (AMRR) using Dynamic Time Quantum with Round Robin Scheduling Algorithm using static Time Quantum, IJITEE,ISSN: 2278-3075, Volume-1, Issue-3, August 2012.

BC Carlson. Algorithms involving arithmetic and geometric means, Amer. Math. Monthly 78 (1971), 496–505. MR 0283246.

Emami Ale Agha, Ashkan & Jafarali Jassbi, Somayyeh. (2013). A New Method to Improve Round Robin Scheduling Algorithm with Quantum Time Based on Harmonic Arithmetic Mean (HARM). International Journal of Information Technology and Computer Science. 5. 10.5815/ijitcs.2013.07.07.

Mohan, Lavanya & Siva, Saravanan. (2013). Robust Quantum Based Low-power Switching Technique to improve System Performance. International Journal of Engineering and Technology. 5. 3634-3638.

Helmy, Tarek & Dekdouk, Abdelkader. (2007). Burst round robin as a proportional-share scheduling algorithm.

Manoj Kumar Srivastav, Sanjay Pandey, Indresh Gahoi and Neelesh Kumar Namdev. “Fair Priority Round Robin with Dynamic Time Quantum : FPRRDQ.” (2012).

Behera, Himanshu Sekhar, P Jajnaseni, Dipanwita Thakur and Subasini Sahoo. “A New Proposed Two Processor Based CPU Scheduling Algorithm with Varying Time quantum for Real Time Systems.” Journal of Global Research in Computer Sciences 2 (2011): 81-87.