Round Robin (RR)(CPU Scheduling)

•  Used in time sharing systems.
• Similar to FCFS with time Quantum.
• It is Pre-emptive.

Advantages

•  Easy to simple to implement.
• Each process gets a fare share of CPU.
• No Starvation.
• No Convey Effect.
• Deterministic response time.
• Priority is same for each process.

Disadvantages

• Throughput depends on time quantum.
• if Time quantum is small then more overload of context switching average waiting time in created.
• if  Time quantum is large then same as First come First Serve.
• Decide size of Time Quantum is very tough.