1.

What is the RR Scheduling Algorithm in OS?

Answer»

The RR (round-robin) scheduling algorithm was designed with time-sharing systems in mind. The CPU scheduler goes around a circular queue, allocating CPU to each task for a time period of up to around 10 to 100 milliseconds. 

It is SIMPLE and easy to IMPLEMENT. It is preemptive because processes are only allotted CPU for a certain amount of time. All processes get an equal share of CPU. DISADVANTAGES include CONTEXT switches, low THROUGHPUT, larger waiting time, and response time. 



Discussion

No Comment Found