![]() ![]() To measure the efficiency of a scheduling algorithm there are some metrics such as Throughput (No. Our work is on Round Robin Scheduling algorithm. FIFO, SJF, SRTF, Priority, Round Robin Scheduling etc. There are many scheduling algorithms available in the literature viz. Now the process that is given to the CPU totally depends upon the scheduling algorithm. The functioning of the CPU scheduler is to take some process from the ready queue and start its execution. The part of the operating system that makes the choice is called the short term scheduler or CPU scheduler. When more than one process is in ready state and there is a single CPU available, the operating system must decide which process to run first. When a computer is multi-tasked, it frequently has multiple processes competing for the CPU at the same time. They have evolved from a single user to a multi tasking environment. INTRODUCTION Now days, the task of modern operating system is more complex than ever before. Keywords:- CPU Scheduling Algorithm, Round Robin (RR), Time Slice, CPU utilization, waiting time, turnaround time, response time. We finally compare our new algorithm with the existing one in terms of waiting time. ![]() We propose a modified version of the Round Robin Algorithm that is based upon the variation in time slice to improve the performance of the system. This paper considers the problem of fixed time slice. This will sometimes affect the performance of CPU. Round Robin assumes that all processes are equally important each receives an equal portion (time slice) of the CPU. The main objective of scheduling algorithms is to reduce the response time, waiting time and to increase the throughput and CPU utilization. 57-61 Modified Round Robin Scheduling Algorithm Using Variable Time Slice 1 Suman Bhatia, 2 Supriya Raheja 1,2 Department of CSE & ITITM University Gurgaon, India Abstract:- CPU scheduling is the basis of multi-programmed operating systems. International Journal of Engineering Research and Development e-ISSN: 2278-067X, p-ISSN: 2278-800X, Volume 8, Issue 2 (August 2013), PP. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |