Round Robin implementation in C
Simulate the following RR CPU scheduling algorithms to find turnaround time and waiting time
Round Robin is a CPU scheduling algorithm where each process is assigned a fixed time slot or quanta in a cyclic way.
Things to remember
- RR is always used in preemptive way
- Commonly used in CPU
- its simple and starvation free since every process is given a fair share of time
- has a Overhead context switch problem
Comments
Post a Comment