Scribd
Upload
18 views

Round Robin Algo

Uploaded by

ranganadh
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
18 views

Round Robin Algo

Uploaded by

ranganadh
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Round Robin CPU Scheduling Algorithm

A round-robin is a CPU scheduling algorithm that shares equal portions of


resources in circular orders to each process and handles all processes
without prioritization. In the round-robin, each process gets a fixed time
interval of the slice to utilize the resources or execute its task called
time quantum or time slice. Some of the round-robin processes are pre-
empted if it executed in a given time slot, while the rest of the processes go
back to the ready queue and wait to run in a circular order with the
scheduled time slot until they complete their task. It removes the starvation
for each process to achieve CPU scheduling by proper partitioning of
the CPU.

Round Robin CPU Scheduling Algorithm


Step 1: Organize all processes according to their arrival time in the ready
queue. The queue structure of the ready queue is based on the FIFO
structure to execute all CPU processes.

Step 2: Now, we push the first process from the ready queue to execute its
task for a fixed time, allocated by each process that arrives in the queue.

Step 3: If the process cannot complete their task within defined time
interval or slots because it is stopped by another process that pushes from
the ready queue to execute their task due to arrival time of the next process
is reached. Therefore, CPU saved the previous state of the process, which
helps to resume from the point where it is interrupted. (If the burst time of
the process is left, push the process end of the ready queue).

Step 4: Similarly, the scheduler selects another process from the ready
queue to execute its tasks. When a process finishes its task within time slots,
the process will not go for further execution because the process's burst time
is finished.

Step 5: Similarly, we repeat all the steps to execute the process until the
work has finished.

Characteristics of Round Robin

1. It is a pre-emptive algorithm.
2. It shares an equal time interval between all processes to complete
their task.
3. It is a starvation free CPU scheduling algorithm. Hence it is known as
the fairest and simple algorithm.

Advantages

1. It does not face any starvation issues or convoy effect.


2. Each process gets equal priority to the fair allocation of CPU.
3. It is easy to implement the CPU Scheduling algorithm.
4. Each new process is added to the end of the ready queue as the next
process's arrival time is reached.
5. Each process is executed in circular order that shares a fixed time slot
or quantum.
6. Every process gets an opportunity in the round-robin scheduling
algorithm to reschedule after a given quantum period.

Disadvantage

1. If the time quantum is lower, it takes more time on context switching


between the processes.
2. It does not provide any special priority to execute the most important
process.
3. The waiting time of a large process is higher due to the short time slot.
4. The performance of the algorithm depends on the time quantum.
5. The response time of the process is higher due to large slices to time
quantum.
6. Getting a correct time slot or quantum is quite difficult for all processes
in the round-robin algorithm.

Round Robin CPU Scheduling Example:


Let's understand the concepts of Round Robin with an example. Suppose we
have five processes P1, P2, P3, P4 and P5. The arrival and burst time of each
process are mentioned in the following table, as shown below. The time
quantum is three units.

Process Arrival Time (AT) Burst Time (BT)

P1 0 8

P2 5 2

P3 1 7

P4 6 3

P5 8 5

Now we have to create the ready queue and the Gantt chart for Round
Robin CPU Scheduler.

Ready queue: P1, P3, P1, P2, P4, P3, P5, P1, P3, P5

Here is the Gantt chart:

Step 1: At time 0, process P1 enters the ready queue and starts its
execution for the defined time slot 3. During 3 units of the time slice, another
process, P3, arrives in the ready queue because its arrival time is 1.

Step 2: Now, process P3 starts its execution with a time slot of 3 units while
process P1 has to wait. After execution of process P3, process P1 again
resumes its execution for time slot 3.

Step 3: During the execution of process P1, two more processes P2 and P4,
arrive in the ready queue to begin their execution. Since process P2 has
come first, it will be executed for time quantum 2 units after that P4 is
executed.
Step 4: Here, P4 has executed for time slot 3 units, and its task is completed
because BT (Burst Time) is 2. Hence it will not go to the ready queue.

Step 5: After that, process P3 is executed from the ready queue for time slot
3 and then process P5 arrives for time slot 3.

Step 6: Meanwhile, process P5 is executed, process P1 and P3 have to wait


in the ready queue.

Step 7: Now process P1 is fetched from the ready queue and starts their
execution for time slot 2 as it requires only 2 BT to finish its tasks. Hence it
will not go to the ready queue for further execution.

Step 8: Now, the process P3 is executed for time slot 1 as it requires only 1
BT to complete its tasks.

Step 9: The final process P5 is executed for time slot 2 because it requires
only 2 BT to complete its tasks.

The following are the important terms to find the Completion time, Turn
Around Time (TAT), Response Time (RT) and Waiting Time (WT).

1. Completion Time: It defines the time when processes complete their


execution.
2. Turn Around Time: It defines the time difference between the
completion time (CT) and the arrival time (AT).
Turn Around Time (TAT) = Completion Time (CT) - Arrival Time (AT)
3. Waiting Time: It defines the total time between requesting action and
acquiring the resource.
Waiting Time (WT) = Turn Around Time (TAT) - Burst Time (BT)

Proces Arrival Burst Completion Turn Waiting Response


s Time Time Time Around Time Time
Time

P1 0 8 22 22 14 0

P2 5 2 11 6 4 4

P3 1 7 23 22 15 2
P4 6 3 14 8 5 5

P5 8 5 25 17 12 9

4. Response Time: It is the time that defines at which time


the system response to a process.

Completion time for process P1 = 22, P2 = 11, P3 = 23, P4 = 14 and P5 =


25.

Turn Around Time for P1 = Completion Time (CT) - Arrival Time (AT)
22 - 0 = 22
Turn Around Time for P2 = 11 - 5 = 6
Turn Around Time for P3 = 23 - 1 = 22
Turn Around Time for P4 = 14 - 6 = 8
Turn Around Time for P5 = 25 - 8 = 17

Waiting Time for P1 = Turn Around Time (TAT) - Burst Time (BT)
22 - 8 = 14
Waiting Time for P2 = 6 - 2 = 4
Waiting Time for P3 = 22 - 7 = 15
Waiting Time for P4 = 8 - 3 = 5
Waiting Time for P5 = 17 - 5 = 12

Average Waiting Time = (14 + 4 + 15 + 5 + 12)/5 = 50/5 = 10

Average Turn Around Time = (22+6+22+8+17)/5= 75/5 = 15

You might also like