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 

Program Output

Comments

Popular posts from this blog

Install VS-Code in Manjaro Linux

Running (pre-loaded)Virtual Machine on VirtualBox

Integrating Bash on Windows(Linux subsystem) into VSCode