Round Robin CPU Scheduling

Round Robin CPU Scheduling :

  • Round Robin CPU Scheduling is similar to FCFS but preemption in added more.
  • It is useful for timesharing systems.
  • Each process is provided a fix small time to execute called time slice or time quantum.
  • Once a process is executed for given time period. Process is preempted and other process executes for given time period.
  • Context switching is used to save states of preempted processes.
  • Time quantum is usually 0-100ms. Too large time quantums can turn to FCFS policy.

C SOURCE CODE :

OUTPUT :

round robin cpu scheduling

Leave a Reply

Your email address will not be published. Required fields are marked *