0
example on round robin problem in OS:
let here p1,p2,p3,p4 are some process and its burst time is given as:
P1=6
P2=8
P3=2
P4=4
time quantum=4 millisec
PROCESSES P1 P2 P3 P4 P1 P2
CPU CYCLES 0 4 8 10 14 16 20
SO in this example, a process cannot exceed more than 4 millisec. so each process is not exceeding more than 4 millisec. as p1 starting time is 0 ms and ending time is 4 ms then another process started at this time which also complete 4 cycles then another process p3 start which need only 2 cycles to complete its execution ,so goes only 2 cycles and finish its execution at time 14 and p4 complete its execution at 14 . now dis process will again started until all the process does not complete its execution remaining in the time quantum limit.
Add your answer:
Earn +20 pts
Which scheduling policy is suited in time sharing operating system?
Round Robin
Advantages of Round Robin Scheduling?
It is the most simple scheduling algorithmn It is easy to implement in software If the processes are of varied length then it becomes slow.
What are different types of CPU scheduling algorithms?
Round robin schedulingPriority schedulingShortest job firstBy Tirok
Which scheduling policy is most suitable for a time shared operating system?
robinhood sorry its--------- round robin
How do you calculate the wait time for round robin scheduling?
waiting time =turn around time-burst time
Difference between round robin scheduling and Weighted round robin scheduling?
One is weighted, the other is not. Simple as.
What kind of data structure is required to implement the round robin scheduling policy?
The circular queue data structure is required to implement the round robin scheduling policy. Round robin is similar to FCFS scheduling.
What is virtual round robin CPU scheduling?
A variant of round robin scheduling is called selfish round robin scheduling. In selfish round robin, there is a maximum limit on the number of processes that can be placed in the round-robin queue (including the process being executed by the CPU). After that maximum is reached, newly entering processes are placed on a holding queue. Processes in the holding queue do not get any time slice of the CPU. When a process in the round-robin queue completes and leaves the system, the oldest process in the holding queue is allowed to enter the round-robin queue
Round robin scheduling program in java?
Round robin is the scheduling algorithm that is utilized by the CPU, or central processing unit, during the execution of the process. It is specifically designed for time sharing systems.
Which preemptive version is round robin scheduling?
FIFO (first in first out)
Which scheduling policy is suited in time sharing operating system?
Round Robin
Which type of scheduling technique being used in windows 7?
Windows 7 uses a round-robin technique scheduling technique.
Advantages of Round Robin Scheduling?
It is the most simple scheduling algorithmn It is easy to implement in software If the processes are of varied length then it becomes slow.
What are different types of CPU scheduling algorithms?
Round robin schedulingPriority schedulingShortest job firstBy Tirok
Which scheduling policy is most suitable for a time shared operating system?
robinhood sorry its--------- round robin
How do you calculate the wait time for round robin scheduling?
waiting time =turn around time-burst time
what are advantages and disadvantages of Round Robin scheduling algorithm?
Pure round robin scheduling processes A, then B, then C, then starts at A again. (A, B, C might be tasks in an operating system context, or devices in a master/slave control network, or whatever.) That is, pure round robin scheduling doesn't acknowledge priorities, and does not allow out-of-order processing. Real-life systems typically use a mixture of algorithms that, together, allow for prioritized and out-of-order processing while, on the other hand, trying to prevent starvation of lower priority items.
