OS | Round Robin Scheduling | Exp - 4
Round Robin Scheduling in OS
Round Robin scheduling algorithm is one of the most popular scheduling algorithm which
can actually be implemented in most of the operating systems. This is the preemptive version of first come first serve scheduling. The Algorithm focuses on Time Sharing. In this algorithm, every process gets executed in a cyclic way. A certain time slice is defined in the system which is called time quantum. Each process present in the ready queue is assigned the CPU for that time quantum, if the execution of the process is completed during that time then the process will terminate else the process will go back to the ready queue and waits for the next turn to complete the execution.
can actually be implemented in most of the operating systems. This is the preemptive version of first come first serve scheduling. The Algorithm focuses on Time Sharing. In this algorithm, every process gets executed in a cyclic way. A certain time slice is defined in the system which is called time quantum. Each process present in the ready queue is assigned the CPU for that time quantum, if the execution of the process is completed during that time then the process will terminate else the process will go back to the ready queue and waits for the next turn to complete the execution.
Problem Statement
An institute have only 3 Computer system but two of them are not in working condition. If there are 3 teacher’s wants to access that machine for different duration so to avoid the waiting time the system will be allotted to the teacher for only 2 min in the single access. Compute the TAT for every teacher.(Round Robin Scheduling Algorithms).
File: Download here
No comments: