First, each and every process gets a quantum time of 100 ms.Lack of priority might be a problem in cases with processes which require immediate attention.Ĭonsider the following example with five processes each one with varied execution time and a quantum time of 100 ms Process Name.Low Throughput, means decreased rate of output or completion as a process is not completely executed at a time.The length of quantum time has a large effect on the waiting time, too less will cause more time waste in switching through the processes than executing them effectively. Higher average waiting time because every process has to wait until it's turn.Threads having same priority are scheduled perfectly with Round Robin as CPU is equally shared between all processes.CPU is best utilized, no need of any extra resources.There will be a improvement in average response time of the processes.No stagnation or starvation of processes occurs, no process gets left behind.Because of the fixed quantum time each and every process has the same priority.Now first each process is given with a fixed amount of time period known as quanta, this time quantum remains fixed throughout the process.Įach process can only be executed for one quanta at a time if the process manages to complete the execution within this time then it is terminated else it is preempted and has to wait for it's turn in a circular order to execute again, here context switching is used to save states of the preempted processes. The aim of this algorithm is to determine or schedule the order of execution of the processes. In fact, Round Robin scheduling algorithm is one of the first algorithms to provide a real time computing experience. It is better than other approaches like Shortest Job First algorithms considering that there is a guarantee that all processes will be completed at the cost of overall performance but it is better than brute force approach. It is also a preemptive scheduling algorithm famous for CPU Scheduling and used in various Operating Systems. The key idea is to allocate CPU to all processes in the same order for the same amount of time. Round Robin Scheduling Algorithm is one of the simplest scheduling algorithm used in various operating systems for process scheduling and networks. Reading time: 25 minutes | Coding time: 10 minutes
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |