Performance Analysis of Modified Round Robin CPU Scheduling Algorithm

Main Article Content

Mohd Vasim Ahamad

Abstract

Operating System is the resource manager of our computer system. And one of most important resource of the computer system is CPU. In multiprogramming operating system, there are several jobs in the main memory. There must be a proper criteria to serve these jobs, this criteria is called CPU scheduling. There are different algorithms to schedule the CPU but each of them have their advantages and disadvantages. In this paper, we have considered mainly Round Robin (RR) Algorithm. This algorithm has the demerit of having high Average Waiting Time (AWT) and high Average Turnaround Time (ATT). The goal is to propose and analyse a CPU Scheduling algorithm in order to reduce the Average Turnaround Time and Average Waiting Time by combining Round Robin Algorithm with Shortest Job first (SJF) Algorithm. To achieve the goal, we have propose two approaches to modify the existing Round Robin Algorithm. In first approach, we have combined the Round Robin Algorithm with Shortest Job First Algorithm and assigned the time quantum as the lowest burst time of first process in sorted (ascending) ready queue. By doing this we are able to reduce Average Turnaround Time but our aim is to reduce the Average Waiting Time also. Therefore, we proposed second approach, in this we have implemented the combination of Round Robin Algorithm with Shortest Job First Algorithm and assign the time quantum with the average of burst time of all the process of the ready queue. By doing this we are able to reduce Average Turnaround Time as well as Average Waiting Time, which was our ultimate goal.

Downloads

Download data is not yet available.

Article Details

Section
Articles
Author Biography

Mohd Vasim Ahamad, Aligarh Muslim University

Computer Engineering Section, University Women's Polytechnic

References

Radhe Shyam, Sunil Kumar Nandal, “Improved Mean Round Robin with Shortest Job First Scheduling†in International Journal of Advanced Research in Computer Science and Software Engineering.

Qudsia Mateen, Ujala Niazi, Marwah, Sobia Khalid, “Grouping Based Job Scheduling Algorithm Using Priority Queue, Shortest Job First, Round Robin and First Come First†in International Journal of Computer and Communication System Engineering (IJCCSE), Vol. 2 (1), 2015, 139-142.

Radhe Shyam, Parmod Kumar, “Improved Round Robin with Shortest Job First Scheduling†Extension Lecturer (Computer Science) Govt. College for Women, Hissar, Haryana, India.

Harvey M. Deitel, Paul J. Choffnes, David R. Choffnes, Operating System, third edition.

Abraham Silberschatz, Peter Baer Galvin,Greg Gagne, Operating System Concepts, sixth edition.

Manish kumar Mishra, “Improved Round Robin CPU Scheduling Algorithmâ€, Journal of Global Research in computer science, ISSN - 2229-371X, vol. 3,No. 6, June 2012.

Rami J Matarneh, “Self- Adjustment Time Quantum in Round Robin Algorithms Depending on Burst Time of the Now Running Processesâ€, American Journal of Applied Sciences, ISSN 1546-92396, (10):1831-1837, 2009.

Rakash Mohanty, Manas Das, “ Design and performance Evaluation of A new proposed fittest Job First Dynamic Round Robin Scheduling Algorithmsâ€, International journal of computer information systems, ISSN: 2229-5208, vol. 2, No. 2, Feb 2011.

Maj. Umar Saleem Butt and Dr. Muhammad Younus Javed, “Simulation of CPU Scheduling Algorithmsâ€,0-7803-6355-8/00/$10.00@2000 IEEE.

Andrew S. Tanenbaum, Albert S. Woodhull, “Operating Systems Design and Implementationâ€, Second Edition.

H.M.Deitel, “Operating Systemsâ€, Pearson Education, Second Edition.

Lalit kishor,Rajendra Singh, “Optimized Scheduling Algorithmsâ€, International journal of computer applications, International conference on computer communication and networks CSI-COMNET-2011

Ishwari Singh Rajput,Deepa Gupta, “A Priority based round robin CPU Scheduling Algorithms for real time systemsâ€, International journal of Innovations in Engineering and Technology, ISSN:2319-1058, Vol. 1 ISSUE 3 ,Oct 2012.