Scribd
Upload
29 views11 pages

Group 4

Uploaded by

Audrey Mendoza
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
29 views11 pages

Group 4

Uploaded by

Audrey Mendoza
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/ 11

By Group 4

Operatin
g System
:

ROUND
ROBIN
• OBJECTIVES
• INTRODUCTION
RO U N D • EXECUTION OF CODE
RO B I N • CONCLUSION
Group Members:
Aguilar, John Emil M. OBJECTIVES
Ang, Paul Anthony Each group will create a
program that will compute
Doniza, Kevin for the Average turn around
time and average waiting
Gicana, Mae Kaila time of a given set of
processes. Gantt chart should
Mendoza, Bernard be shown after the
Montecillo, Peter computation. The number of
processes, arrival times, burst
Requiz, Kathleen times, quantum and priority
number is to be provided by
the user. The CPU
The name of this algorithm
Introduction comes from the round-robin
principle, where each person
gets an equal share of
something in turns. It is the
oldest, simplest scheduling
algorithm, which is mostly
used for multitasking.
In Round-robin scheduling,
each ready task runs turn by
turn only in a cyclic queue
for a limited time slice. This
algorithm also offers
starvation free execution of
processes.
Execution of
Code
Simulation
Step 1: Enter the number of
processes
Execution of
Code
Simulation
Step 2: Enter the Time
Quantum
Execution of
Code
Simulation
Step 3: Enter the following
Processes, Arrival times &
Burst Time of each
OU T P U T
B L E O F:
H E T A
WITH T ,
O C E S S E S
(1 ) PR
L T I M E ,
A R R I VA
N T IM E ,
PL E T IO
COM U R N
T I M E , T
BURS T
I M E A N D
N D T
AROU .
N G T I M E
W A IT I
U D I N G :
INCL F A V G .
T I N G O
COMPU & A V G .
N G T I M E
W A IT I E
U N D T I M
R O
TURN A
OU T P U T

E RTI CAL
HART (V
GANTT C
VIEW)
CONCL U S I O N S

In computer operations, round robin is used in a scheduling algorithm that


distributes work evenly among all available resources. This ensures that no single
resource is overworked, which can lead to errors and other issues down the line.
The round-robin (RR) scheduling algorithm is designed especially for
timesharing systems. It is similar to FCFS scheduling, but preemption is added to
enable the system to switch between processes. A small unit of time, called a time
quantum or time slice, is defined. The ready queue is treated as a circular queue.
THAN
K
www.reallygreatsite.com

You might also like