Home / Current Issue / Paper 1700273
An Improved Round Robin CPU Scheduling
Subject area: Science,Engineering and Technology · Area of research: Computer engineering
Abstract
CPU is one of the most important component of the computer which is used for scheduling the process known as CPU Scheduling. It is the process of scheduling the process one after another while one is on hold and other is in ready state. Many types of scheduling algorithms are there like First-Come-First-Served(FCFS), Shortest Job First(SJF), Priority Scheduling and Round Robin which basically focus on maximizing throughput and CPU utilization and minimizing response time, turnaround time, number of context switching and waiting time. In this paper we proposed an improved round robin CPU scheduling algorithm. The result shows that improved round robin Scheduling is always giving better result than the conventional Round Robin Scheduling Algorithm.
Keywords
Round Robin Scheduling, Response Time, Time Quantum, Burst Time, Waiting Time, Turnaround Time.
References
[1] Rakesh Kumar Yadav, Abhishek K Mishra, Navin Prakash and Himanshu Sharma, “An Improved Round Robin Schedduling Algorithm for CPU Scheduling”, International Journal on Computer Science and Engineering, Vol. 02, No. 04, 2010, pp. 1064-1066.
[2] Abbas Noon, Ali Kalakech, and Seifedine Kadry, “A New Round Robin based Scheduling Algorithm for Operating Systems: Dynamic Quantum Using the Mean Average”, International Journal of Computer Science Issues, Vol. 8, Issue 3, No. 1, May 2011, pp. 224-229.
[4] Seltzer, M P. Chen and J outerhout, 1990, Disk scheduling revisited in USENIX, Winter technical conference.
[5] A. Silberschatz, P. B. Galvin, and G. Gagne, “Operating System Concepts”, 7th Edn., John Wiley and Sons Inc, 2005, ISBN 0-471- 69466-5.
[6] M.K. Srivastav, Sanjay Pandey, Indresh Gahoi and Neelesh Kumar Namdev, “Fair Priority Round Robin with Dynamic Time Quantum”, International Journal of Modern Engineering Research, Vol. 02, Issue. 03, May-June 2012, pp. 876-881.
[7] H.S. Behera, Rakesh Mohanty, Jajnaseni Panda, Dipanwita Thakur and Subasini Sahoo, “Experimental Analysis of a New Fare-Share Scheduling Algorithm with Waited Time Slice for Real Time Systems”, Journal of Global Research in Computer Science, Vol. 2, No. 2, February 2011, pp. 54- 60.
[8] 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.
[9] Sunita Mohan,“Mixed Scheduling (A New Scheduling Policy)”, Proceedings of Insight’09, 25-26 November 2009.
How to cite this paper
@article{1700273,
author = {Neha, Ankita Jiyani},
title = {An Improved Round Robin CPU Scheduling },
journal = {Iconic Research And Engineering Journals},
year = {2018},
volume = {1},
number = {9},
pages = {82-86},
issn = {2456-8880},
url = {https://www.irejournals.com/formatedpaper/1700273.pdf},
abstract = {CPU is one of the most important component of the computer which is used for scheduling the process known as CPU Scheduling. It is the process of scheduling the process one after another while one is on hold and other is in ready state. Many types of scheduling algorithms are there like First-Come-First-Served(FCFS), Shortest Job First(SJF), Priority Scheduling and Round Robin which basically focus on maximizing throughput and CPU utilization and minimizing response time, turnaround time, number of context switching and waiting time. In this paper we proposed an improved round robin CPU scheduling algorithm. The result shows that improved round robin Scheduling is always giving better result than the conventional Round Robin Scheduling Algorithm.},
keywords = {Round Robin Scheduling, Response Time, Time Quantum, Burst Time, Waiting Time, Turnaround Time.},
month = {March},
}