Dynamical Modified R.R. CPU Scheduling Algorithm
 | International Journal of Computer Trends and Technology (IJCTT) |  |
| © - Issue 2013 by IJCTT Journal | ||
| Volume-4 Issue-2 | ||
| Year of Publication : 2013 | ||
| Authors :Amit Kumar Sain. |
Amit Kumar Sain."Dynamical Modified R.R. CPU Scheduling Algorithm"International Journal of Computer Trends and Technology (IJCTT),V4(2):90-93 Issue 2013 .ISSN 2231-2803.www.ijcttjournal.org. Published by Seventh Sense Research Group.
Abstract: -Central Processing Unit (CPU) plays a significant role in computer system by transferring its control among different processes. As CPU is a central component, hence it must be used efficiently. Operating system performs an essential task, which is known as CPU scheduling used for efficient utilization of CPU.CPU Scheduling is a discipline which helps us gain deep insight into the complex set of policies and mechanisms used to govern the order in which tasks are executed by the processor. This paper proposes a Dynamic time quantum Shortest Job Round Robin CPU Scheduling algorithm having better average waiting time (AWT) and average turnaround time (ATT) as compared to other CPU Scheduling techniques. The primary objective of this algorithm is to optimize system performance according to the criteria deemed most important by system designers.
References-
[1] Abraham Silberschatz , Peter Baer Galvin, Greg Gagne, “Operating System Concepts”,Sixth Edition.
[2] Andrew S. Tanenbaum, Albert S. Woodhull, “Operating Systems Design and Implementation”, Second Edition
[3] H.M.Deitel, “Operating Systems”, Pearson Education, Second Edition
[4] http://en.wikipedia.org/wiki/Scheduling (computing).
[5] Maj. Umar Saleem Butt and Dr. Muhammad Younus Javed, “Simulation of CPU Scheduling Algorithms”,0-7803-6355-8/00/$10.00@2000 IEEE
[6] Rami J. Matarneh, “Self Adjustment Time Quantum in Round Robin Algorithm Depending on Burst Time of the Now Running Processes”,American Journal of Applied Sciences 6(10): 18311-1837, 2009, ISSN 1546-9239
[7] Gary Nutt, “Operating Systems, A Modern Perspective”, Second Edition
Keywords—First Come First Serve Algorithm, Shortest Job First Algorithm, Round Robin Algorithm, Priority Algorithm, Average Waiting Time, Turnaround Time, Response Time, Throughput.