Scribd
Upload
59 views

Round Robin: Prepared by

Round Robin is a preemptive process scheduling algorithm where each process is given a fixed time quantum to execute before being preempted. When the time quantum expires, the current process is preempted and another process gets a turn. Context switching is used to save the state of the preempted process. Round Robin ensures all processes are given equal priority and starvation is avoided since each process is guaranteed a time slice in each round. However, if the time quantum is too short, processor efficiency may be reduced.

Uploaded by

Rifat Ibn Alam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
59 views

Round Robin: Prepared by

Round Robin is a preemptive process scheduling algorithm where each process is given a fixed time quantum to execute before being preempted. When the time quantum expires, the current process is preempted and another process gets a turn. Context switching is used to save the state of the preempted process. Round Robin ensures all processes are given equal priority and starvation is avoided since each process is guaranteed a time slice in each round. However, if the time quantum is too short, processor efficiency may be reduced.

Uploaded by

Rifat Ibn Alam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 5

ROUND ROBIN

Prepared By-

RIFAT-IBN-ALAM
ID: 21-92099-2
Section: A
ADVANCED OPERATING SYSTEM [MsCS]
Faculty: DR. AFROZA NAHAR
ROUND ROBIN

 Round Robin is a preemptive process scheduling algorithm.

 Each process is provided a fixed time to execute, it is called a time quantum.

 Once a process is executed for a given time period, it is preempted, and other process executes for the

given time period.

 Context switching is used to save states of preempted processes.

ALPINE SKI HOUSE


HOW IT WORKS
Process Arrival Burst Completion
TAT WT
No. Time Time Time Let’s assume,
P1 0 5 3 1 0 12 12 7
Time Quantum= 2
P2 1 4 2 0 11 10 6

P3 2
2 0
6 4 2
TAT= CT - AT
WT= TAT - BT
P4 4 1 0 9 5 4

Ready Queue P1 P2 P3 P1 P4 P2 P1

Gantt Chart P1 P2 P3 P1 P4 P2 P1
0 2 4 6 8 9 11
12
The average waiting time = Total waiting time / No. of Processes
= (7+6+2+4) / 4 = 4.75
ALPINE SKI HOUSE
ADVANTAGES
 Each process is served by the CPU for a fixed time quantum, so all processes are given the same
priority.
 Starvation doesn't occur because for each round robin cycle, every process is given a fixed time to
execute. No process is left behind.

DISADVANTAGES
 If slicing time of OS is low, the processor output will be reduced.
 Its performance heavily depends on time quantum.

ALPINE SKI HOUSE


THANK YOU!

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy