International Journal of Innovative Research in Computer Science and Technology
Year: 2015, Volume: 3, Issue: 3
First page : ( 107) Last page : ( 110)
Online ISSN : 2350-0557.
Article Tools: Print the Abstract | Indexing metadata | How to cite item | Email this article | Post a Comment
Sri Lakshmi .K , Korupala Venkataramani , Sindhe Swetha
CPU Scheduling is one of the fundamental concepts of operating system. There exists a number of CPU scheduling algorithms like first come f irst serve, shortest job first scheduling, round robin scheduling, priority scheduling etc. In these algorithms the round robin CPU scheduling is the preferred choice in time shared systems but it is not suitable for Real time systems ,because the existing RR CPU scheduling depends on the choice of static time quantum that decreases the performance of CPU and also have more number of context switches and longer waiting and response time.This in turn leads to low throughput of the system. In a real time systems the process having relatively larger CPU burst time it will leads to the problem of starvation.In this paper we have proposed a new algorithm that gives better CPU performance using the features of shortest job first and round robin scheduling with dynamic time quantum. This algorithm reduces the average waiting time, average turnaround time and number of context switches and also it gives high throughput. The proposed algorithm improves all the disadvantages of simple RR CPU Scheduling algorithm.
[1] Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, ―Operating System Concepts‖, Sixth Edition.
[2] Ishwari Singh Rajput,‖ A Priority based Round Robin CPU Scheduling Algorithm for Real Time Systems‖.
[3] Sukanya Suranauwarat, ―A CPU Scheduling Algorithm Simulator‖, October 10-13, 2007, Milwaukee, WI 37th ASEE/IEEE Frontiers in Education Conference.
[4] Andrew S.Tanenbaum, Albert S. Woodhull, ―Operating Systems Design and Implementation‖, Second Edition.
[5] Rakesh Kumar Yadav, Abhishek K Mishra, Navin Prakash, Himanshu Sharma,‖ An Improved Round Robin Scheduling Algorithm for CPU Scheduling‖, (IJCSE) International Journal on Computer Science and Engineering Vol. 02, No. 04, 1064-1066, 2010.
[6] Manish Kumar Mishra and Dr. Faizur Rashid, ―An Improved Round Robin CPU Scheduling Algorithm with varying Time Quantum ― International Journal of Computer Science, Engineering and Applications (IJCSEA) Vol.4, No.4, August 2014.
[7] P.Surendra Varma , ―A FINEST TIME QUANTUM FOR IMPROVING SHORTEST REMAINING BURST ROUND ROBIN (SRBRR) ALGORITHM" Journal of Global Research in Computer Science, 4 (3), March 2013, 10-15.
[8] Neeraj Kumar, Nirvikar ―Performance Improvement Using CPU Scheduling Algorithm-SRT‖International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)Volume 2, Issue 2, March – April 2013.
[9] Md. Mamunur Rashid and Md. Nasim Adhtar, ― A New Multilevel CPU Scheduling Algorithm‖, Journals of Applied Sciences 6 (9): 2036-2039,2009
received the degree Master of Technology in Computer Science& Engineering from Andhra University, Visakhapatnam. She is an Associate Professor in CSE Department at Dadi Institute of Engineering and Technology, Anakapalle, Andhra Pradesh, India. Her research interests are in Operating Systems, Computer Networks.
No. of Downloads: 11 | No. of Views: 1581
Abinesan S, E. Boopathi Kumar.
May 2025 - Vol 13, Issue 3
S. Venkataramana, G. V. Satya Sri Sai, J. D. S. Preetham, J. Mohan Sai, K. Jashwanth Sree.
March 2025 - Vol 13, Issue 2
Sheharyar Nasir, Shumail Sahibzada, Farrukh Sher Malik.
March 2025 - Vol 13, Issue 2
