As we know it requires only 1 unit of bursts time, so it will get completed.Īs P1 also get completed. Now the process P1 will be executed so that it can complete its execution as its turn has come. So we add it in the ready queue in the back. Now the process has not completed as 1 unit of burst time is left. Again, the process P4 gets completed as it has only 1 unit of bursts time. The next process in the queue is P5 which has 5 units of bursts time. So, we will not add P3 in the ready queue and now we will execute the next process P4. Now the process P3 is completed in the time slice of 4 units. Now, P3 will be executed for 3 units of time slice as its bursts time is 3 units. So, again we will add P2 in the ready queue at the back. Also, we know that P2 has not completed yet as its 2 units of burst time is still left. The time quantum is 4 units.ĭuring the execution time of P2, another process P6 arrives in the ready queue. In this example, we will take six processes P1, P2, P3, P4, P5 and P6 whose arrival and burst time are given in the table. It is generally used by those operating systems which has multiple clients to make use of resources. We make use of round robin scheduling algorithm in a time-sharing system. The scheduling drives its name from the principle which is known as a round robin in which every person takes an equal share of anything they have in turn. Now, if the execution of the process gets completed in that time quantum, then the process will get terminate otherwise the process will again go to the ready queue, and the previous process will wait for the turn to complete its execution. Every process, which is present in the queue for processing, CPU is assigned to that process for that time quantum. in this a particular time slice is allotted to each process which is known as time quantum.
Definition: Round robin scheduling is the preemptive scheduling in which every process get executed in a cyclic way, i.e.
0 kommentar(er)
