Skip to main content

Operating Systems | Scheduling Algorithms : Round Robin

Round Robin

Features :

  • Most popular algorithm of all
  • Practically implementable
  • Implementable with basic data structures like queue
  • Extremely lesser starvation
  • Optimum efficiency can be set by controlling time quantum

The round robin algorithm will continuously switch between processes if a process in CPU (under execution) exceeds a time limit set by OS called time quantum.

Flow Chart :

  • Scheduler allocated process to for execution.
  • CPU starts monitoring the execution time right after from allocation.
  • If the process completes its execution before exceeding time quantum, OS forwards the process to termination state.
  • else, the processes gets preempted once the time quantum limit exceeded and if the process finished at this moment, OS moves the process to termination state, else it moves to ready queue and iterates over the whole process listed above.

Example : Consider the following table of processes and calculate completion time, turn around time and waiting time using Round Robin algorithm.

    Assumptions:

  • Time quantum = 2unit
  • Preemptive algorithm.
  • No I/O request will be there from any process.
  • Arrival time is relative to CPU on time.
Process AT BT
P1 0 2
P2 1 2
P3 2 4
P4 3 1
P5 4 2



Scheduler has to move new process from the frond on the ready queue,when either the current running process get terminates with out exceeding time quantum or the process reached the limit of time quantum. In second case if the process did not processed completely it has to enqueue again at the back of ready queue.

Execution of the set of given in above example can be depicted as follows:

Process Number AT BT CT TAT WT
1 0 2 2 2 0
2 1 2 4 3 1
3 2 4 11 9 5
4 3 1 7 4 3
4 5 2 9 4 2



By observing the nature of representations it can be found out that as the length of time quantum increases frequency of context switching decreases. A decrements in time quantum reduces the time gap between switching of processes, so there will be a smaller response time and lesser starvation. Algorithm with infinite time quantum is what we call FCFS algorithm.

Comments

Popular posts from this blog

Operating Systems | Concept of Process

Hard disk drive of the system in called primary memory and secondary memory is Random Access Memory(RAM). Either a program written in High Level Language(HLL) or a executable code generated by the sequence of works done by pre-processor, compiler and assembler, resides in secondary memory of the system. To start an execution, operating system allocates some space in the main memory, for the program to be executed and loads the program in the secondary memory to the allocated space. The piece of work which is loaded by the operating system to the main memory in order to execute program is called processEvery program loaded by operating system will create a focus boundary(or process body), a partitioned memory area where all memory requirements for the execution of program is satisfied.Variable which will not change its value through out life time of process is called static variable and variables which are globally accessible in a process known as global variable.Heap area is reserved f…

Operating Systems | Scheduling Algorithms : SJF

| FCFS | SJF | SRTS | Round Robin | LJF | Priority Scheduling | HRRN | Shortest Job First(SJF)SJF algorithm schedules the shortest job(low burst time) available on main memory at the time of context switching in ready state . It can be either preemptive or non-preemptive depending on the nature of scheduler.Since the SJF select the job which is shorted among available jobs on main memory, Non-preemptive SJF algorithm will have larger waiting time if a job with longer burst time get scheduled first. In short SJF is also vulnerable to Convoy EffectTo find shortest process among min-heap would be the best data structure to be usedExample : Consider the following table of processes and calculate completion time, turn around time and waiting time using SJF algorithm with the following assumptions. No preemption.No I/O request will be there from any process.Arrival time is relative to CPU on time.Process NumberATBT103222324442View Answer

The execution of processes can be visualized …