Question

Answer each part of the question completely. Consider and discuss the relationship between process preemption and round robin scheduling. Why would we choose to use RR over Shortest Job First? What is the time quantum and why is it important?

Answer 1

Answer)

Preemption happens when the new process arrives and is in the ready queue which is predicted to have a shorter burst time than the time remaining in the particular process which is currently in the CPU. This is sometimes called the shortest remaining time first scheduling.

Round robin also follows the preemptive scheduling algorithm where the processes are given turns during execution one after the other in a sequence which is repetitive where everyone is preempted to have a time slice.

One of the major advantages of round-robin algorithm is that it improves the average response time and also limits every task to have some amount of time where the operating system would ensure the cycle for the ready task and provides the chance to each process whereas in SJF the time taken by the process is not known to the CPU before and hence a process can have more waiting time and can lead to starvation.

The time quantum is a theory where the time is considered as the quantum variable with the discrete spectrum with the consistency of special relativity.

It is most important in non-linear programming model for helping to determine the optimal value of the time for minimising the average wait time.

If you found the answer useful, hit like
Hope this answer helps.
Thanks